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 involves retracing the connection between the quantum adiabatic algorithm and the QAOA, and naturally suggests a refined definition of the 'phase separator' and 'mixer' keywords.
- Publication:
-
New Journal of Physics
- Pub Date:
- July 2024
- DOI:
- arXiv:
- arXiv:2302.04968
- Bibcode:
- 2024NJPh...26g3001B
- Keywords:
-
- quantum computing;
- QAOA;
- VQA;
- adiabatic evolution;
- Quantum Physics
- E-Print:
- 10 pages, 2 figures