Elementary Proof of QAOA Convergence

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Binkowski, Lennart, Koßmann, Gereon, Ziegler, Timo, Schwonnek, René
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910524410691584
author Binkowski, Lennart
Koßmann, Gereon
Ziegler, Timo
Schwonnek, René
author_facet Binkowski, Lennart
Koßmann, Gereon
Ziegler, Timo
Schwonnek, René
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2302_04968
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Elementary Proof of QAOA Convergence
Binkowski, Lennart
Koßmann, Gereon
Ziegler, Timo
Schwonnek, René
Quantum Physics
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.
title Elementary Proof of QAOA Convergence
topic Quantum Physics
url https://arxiv.org/abs/2302.04968