Digitized-counterdiabatic quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems. Since the QAOA is an Ansatz-dependent algorithm, there...

Full description

Saved in:

Bibliographic Details
Published in:	Physical review research Vol. 4; no. 1; p. 013141
Main Authors:	Chandarana, P., Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Solano, E., del Campo, A., Chen, Xi
Format:	Journal Article
Language:	English
Published:	American Physical Society 01.02.2022
ISSN:	2643-1564, 2643-1564
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems. Since the QAOA is an Ansatz-dependent algorithm, there is always a need to design Ansätze for better optimization. To this end, we propose a digitized version of the QAOA enhanced via the use of shortcuts to adiabaticity. Specifically, we use a counterdiabatic (CD) driving term to design a better Ansatz, along with the Hamiltonian and mixing terms, enhancing the global performance. We apply our digitized-CD QAOA to Ising models, classical optimization problems, and the P-spin model, demonstrating that it outperforms the standard QAOA in all cases we study.
ISSN:	2643-1564 2643-1564
DOI:	10.1103/PhysRevResearch.4.013141