Results 31 to 40 of about 605 (179)
Graph neural network initialisation of quantum approximate optimisation [PDF]
Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in the near term.
Nishant Jain +3 more
doaj +1 more source
Mean-Field Approximate Optimization Algorithm
The quantum approximate optimization algorithm (QAOA) is suggested as a promising application on early quantum computers. Here a quantum-inspired classical algorithm, the mean-field approximate optimization algorithm (mean-field AOA), is developed by ...
Aditi Misra-Spieldenner +5 more
doaj +1 more source
JuliQAOA: Fast, Flexible QAOA Simulation
We introduce JuliQAOA, a simulation package specifically built for the Quantum Alternating Operator Ansatz (QAOA). JuliQAOA does not require a circuit-level description of QAOA problems, or another package to simulate such circuits, instead relying on a more direct linear algebra implementation.
John Golden 0001 +4 more
openaire +2 more sources
The QAOA with Few Measurements
The Quantum Approximate Optimization Algorithm (QAOA) was originally developed to solve combinatorial optimization problems, but has become a standard for assessing the performance of quantum computers. Fully descriptive benchmarking techniques are often prohibitively expensive for large numbers of qubits ($n \gtrsim 10$), so the QAOA often serves in ...
Polloreno, Anthony M., Smith, Graeme
openaire +2 more sources
QED driven QAOA for network-flow optimization [PDF]
We present a general framework for modifying quantum approximate optimization algorithms (QAOA) to solve constrained network flow problems. By exploiting an analogy between flow-constraints and Gauss' law for electromagnetism, we design lattice quantum ...
Yuxuan Zhang +2 more
doaj +1 more source
Despite its popularity, several empirical and theoretical studies suggest that the quantum approximate optimization algorithm (QAOA) has persistent issues in providing a substantial practical advantage. Numerical results for few qubits and shallow circuits are, at best, ambiguous, and the well-studied barren plateau phenomenon draws a rather sobering ...
Gereon Koßmann +4 more
openaire +3 more sources
Parameter Setting in Quantum Approximate Optimization of Weighted Problems [PDF]
Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate algorithm for solving combinatorial optimization problems on quantum computers. However, in many cases QAOA requires computationally intensive parameter optimization.
Shree Hari Sureshbabu +6 more
doaj +1 more source
Digitized-counterdiabatic quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems.
P. Chandarana +6 more
doaj +1 more source
ABSTRACT X‐ray fluorescence (XRF) analysis combines spectral inverse modeling, elemental support selection and spatial interpretation. We develop quadratic unconstrained binary optimization (QUBO) and Ising formulations for these tasks. A detector‐response dictionary of broadened candidate emission‐line profiles induces a spectral overlap graph that ...
George Kourousias +6 more
wiley +1 more source
Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models [PDF]
The parity mapping provides a geometrically local encoding of the Quantum Approximate Optimization Algorithm (QAOA), at the expense of having a quadratic qubit overhead for all-to-all connected problems. In this work, we benchmark the parity-encoded QAOA
Elisabeth Wybo, Martin Leib
doaj +1 more source

