Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs

Quantum approximate optimization algorithms are hybrid quantum-classical variational algorithms designed to approximately solve combinatorial optimization problems such as the MAX-CUT problem. In spite of its potential for near-term quantum applications, it has been known that quantum approximate op...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Quantum information processing Jg. 23; H. 3
Hauptverfasser:	Bae, Eunok, Lee, Soojoon
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 26.02.2024
Schlagworte:	Data Structures and Information Theory Mathematical Physics Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Spintronics Complete graphs 68Q12 81P68 Recursive quantum approximate optimization algorithms MAX-CUT problem
ISSN:	1573-1332, 1573-1332
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!