Elementary proof of QAOA convergence
Abstract The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof
Lennart Binkowski +3 more
openaire +4 more sources
Counterdiabaticity and the quantum approximate optimization algorithm [PDF]
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the final state is
Jonathan Wurtz, Peter J. Love
doaj +1 more source
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths [PDF]
We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the starting state is the most excited state of the mixing Hamiltonian.
Reuben Tate +4 more
doaj +1 more source
Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs [PDF]
The $p$-stage Quantum Approximate Optimization Algorithm (QAOA$_p$) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond $p=1$.
Kunal Marwaha
doaj +1 more source
Feature Selection for Classification with QAOA
Feature selection is of great importance in Machine Learning, where it can be used to reduce the dimensionality of classification, ranking and prediction problems. The removal of redundant and noisy features can improve both the accuracy and scalability of the trained models.
Turati G. +2 more
openaire +4 more sources
Quantum annealing initialization of the quantum approximate optimization algorithm [PDF]
The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks.
Stefan H. Sack, Maksym Serbyn
doaj +1 more source
QAOA-in-QAOA: Solving Large-Scale MaxCut Problems on Small Quantum Machines
The design of fast algorithms for combinatorial optimization greatly contributes to a plethora of domains such as logistics, finance, and chemistry. Quantum approximate optimization algorithms (QAOAs), which utilize the power of quantum machines and inherit the spirit of adiabatic evolution, are novel approaches to tackle combinatorial problems with ...
Zeqiao Zhou +3 more
openaire +2 more sources
Bayesian Optimization for QAOA
The Quantum Approximate Optimization Algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum circuit. In this work we present a Bayesian optimization procedure to fulfil this optimization task, and
Simone Tibaldi +3 more
openaire +4 more sources
Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware [PDF]
Quantum computers may provide good solutions to combinatorial optimization problems by leveraging the Quantum Approximate Optimization Algorithm (QAOA). The QAOA is often presented as an algorithm for noisy hardware.
Johannes Weidenfeller +6 more
doaj +1 more source
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size [PDF]
The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$.
Edward Farhi +3 more
doaj +1 more source

