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...

Celý popis

Podrobná bibliografia

Vydané v:	Quantum information processing Ročník 23; číslo 3
Hlavní autori:	Bae, Eunok, Lee, Soojoon
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 26.02.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!