Details
| Original language | English |
|---|---|
| Publication status | E-pub ahead of print - 9 Feb 2023 |
Abstract
Keywords
- quant-ph
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2023.
Research output: Working paper/Preprint › Preprint
}
TY - UNPB
T1 - Elementary Proof of QAOA Convergence
AU - Binkowski, Lennart
AU - Koßmann, Gereon
AU - Ziegler, Timo
AU - Schwonnek, René
N1 - 10 pages, 2 figures
PY - 2023/2/9
Y1 - 2023/2/9
N2 - 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.
AB - 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.
KW - quant-ph
U2 - 10.48550/arXiv.2302.04968
DO - 10.48550/arXiv.2302.04968
M3 - Preprint
BT - Elementary Proof of QAOA Convergence
ER -