Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Benchasattabuse, Naphan, Bärtschi, Andreas, García-Pintos, Luis Pedro, Golden, John, Lemons, Nathan, Eidenbenz, Stephan
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2308.15442