An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz
Xiao-Hui Ni, Yu-Sen Wu, Bin-Bin Cai, Wen-Min Li, Su-Juan Qin, Fei Gao

TL;DR
This paper introduces AMA-QAOA+, an adaptive mixer allocation algorithm for QAOA+ that improves solution quality and reduces quantum gate costs in solving combinatorial optimization problems.
Contribution
It proposes an adaptive strategy for mixer application in QAOA+ that enhances efficiency and solution quality compared to the standard approach.
Findings
Achieves up to 5.41% better approximation ratio.
Reduces CNOT gate usage to 15-25% of QAOA+.
Improves solution quality with fewer quantum resources.
Abstract
Recently, Hadfield et al. proposed the quantum alternating operator ansatz algorithm (QAOA+), an extension of the quantum approximate optimization algorithm (QAOA), to solve constrained combinatorial optimization problems (CCOPs). Compared with QAOA, QAOA+ enables the search for optimal solutions within a feasible solution space by encoding problem constraints into the mixer Hamiltonian, thereby reducing the search space and eliminating the possibility of yielding infeasible solutions. However, QAOA+ may incur high overall gate costs when the mixer is applied to all qubits in each layer, and each mixer is costly to implement. To address this challenge, an adaptive mixer allocation strategy is tailored for QAOA+. The resulting algorithm, which integrates this strategy into the original QAOA+ framework, is referred to as AMA-QAOA+. Unlike QAOA+, AMA-QAOA+ adaptively applies the mixer to a…
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
TopicsSpectral Theory in Mathematical Physics · Surface and Thin Film Phenomena
