Elementary proof of QAOA convergence

1Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Binkowski, L., Koßmann, G., Ziegler, T., & Schwonnek, R. (2024). Elementary proof of QAOA convergence. New Journal of Physics, 26(7). https://doi.org/10.1088/1367-2630/ad59bb

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free