Shortcuts to Quantum Approximate Optimization Algorithm
Yahui Chai, Yong-Jian Han, Yu-Chun Wu, Ye Li, Menghan Dou, Guo-Ping, Guo

TL;DR
This paper introduces S-QAOA, a modified quantum algorithm that incorporates additional two-body interactions to reduce circuit depth and improve solution quality for quantum optimization problems.
Contribution
The paper proposes S-QAOA, a novel ansatz that includes extra two-body interactions and parameter freedoms to enhance QAOA performance on near-term quantum devices.
Findings
YY interaction yields the best performance among tested interactions.
Releasing parameter freedom improves success rate.
Counterdiabatic effects may explain YY interaction's effectiveness.
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as "Shortcuts to QAOA" (S-QAOA), S-QAOA provides shortcuts to the ground state of target Hamiltonian by including more two-body interactions and releasing the parameter freedoms. To be specific, besides the existing ZZ interaction in the QAOA ansatz, other two-body interactions are introduced in the S-QAOA ansatz such that the approximate solutions could be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
