Modified recursive QAOA for exact MAX-CUT solutions on bipartite graphs: closing the gap beyond QAOA limit

Quantum approximate optimization algorithm (QAOA) is a quantum–classical hybrid algorithm proposed with the goal of approximately solving combinatorial optimization problems such as the MAX-CUT problem. It has been considered a potential candidate for achieving quantum advantage in the noisy interme...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of physics. A, Mathematical and theoretical Jg. 58; H. 48
Hauptverfasser:	Bae, Eunok, Kwon, Hyukjoon, Vijendran, V, Lee, Soojoon
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IOP Publishing 28.11.2025
Schlagworte:	bipartite graphs MAX-CUT problem quantum approximate optimization algorithm recursive quantum approximate optimization algorithm
ISSN:	1751-8113, 1751-8121
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!