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

Full description

Bibliographic Details

Published in:	Quantum information processing Vol. 23; no. 3
Main Authors:	Bae, Eunok, Lee, Soojoon
Format:	Journal Article
Language:	English
Published:	New York Springer US 26.02.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!