Abstract
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.
Funder
Deutsche Forschungsgemeinschaft
Deutscher Akademischer Austauschdienst
Quantum Valley Lower Saxony
Bundesministerium für Bildung und Forschung
Reference24 articles.
1. A quantum approximate optimization algorithm;Farhi,2014
2. Quantum computation by adiabatic evolution;Farhi,2000
3. Quantum annealing in the transverse Ising model
4. Perspectives of quantum annealing: methods and implementations
5. Wasserstein solution quality and the quantum approximate optimization algorithm: a portfolio optimization case study;Baker,2022
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献