Adaptive quantum optimization algorithms for programmable atom-cavity systems
Yuchen Luo, Xiaopeng Li, Jian Lin

TL;DR
This paper explores adaptive quantum algorithms, specifically an enhanced QAOA, for programmable atom-cavity systems to efficiently solve number partitioning problems within coherence times.
Contribution
It introduces an adaptive QAOA that incorporates counterdiabatic terms, significantly improving solution success rates at low circuit depths.
Findings
Standard QA success decays with problem size
Standard QAOA gets trapped in local minima
Adaptive QAOA achieves optimal solutions with small circuit depth
Abstract
Developing quantum algorithms adaptive to specific constraints of near-term devices is an essential step towards practical quantum advantage. In a recent work [Phys. Rev. Lett. 131, 103601(2023)], we show cold atoms in an optical cavity can be built as a universal quantum optimizer with programmable all-to-all interactions, and the effective Hamiltonian for atoms directly encodes number partitioning problems (NPPs). Here, we numerically investigate the performance of quantum annealing (QA) and quantum approximate optimization algorithm (QAOA) to find the solution of NPP that is encoded in the ground state of atomic qubits. We find the success probability of the standard QA decays rapidly with the problem size. The optimized annealing path or inhomogeneous driving fields only lead to mild improvement on the success probability. Similarly, the standard QAOA always gets trapped in a false…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
