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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Physical review research Ročník 4; číslo 1; s. 013141
Hlavní autoři:	Chandarana, P., Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Solano, E., del Campo, A., Chen, Xi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	American Physical Society 01.02.2022
ISSN:	2643-1564, 2643-1564
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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