Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demon...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Quantum information processing 2021-02, Vol.20 (2), Article 59
Hauptverfasser:	Herrman, Rebekah, Ostrowski, James, Humble, Travis S., Siopsis, George
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Boolean algebra Chromatic index Circuit depth Circuits Combinatorial analysis Combinatorial optimization Data Structures and Information Theory Lower bounds Mathematical Physics MATHEMATICS AND COMPUTING Optimization Optimization algorithms Physics Physics and Astronomy Quantum approximate optimization algorithm Quantum Computing Quantum Information Technology Quantum Physics Spintronics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!