Applying Grover-mixer Quantum Alternating Operator Ansatz Algorithm to High-order Unconstrained Binary Optimization Problems
Evgeniy O. Kiktenko, Elizaveta V. Krendeleva, and Aleksey K. Fedorov

TL;DR
This paper explores the use of Grover-mixer QAOA for high-order binary optimization problems, demonstrating its superior performance and efficiency over traditional methods through numerical and analytical studies.
Contribution
It introduces a novel application of GM-QAOA to HUBO problems, with an analytical framework for parameter modeling and a resource-efficient implementation that nearly matches fully optimized performance.
Findings
GM-QAOA shows monotonic performance improvement with circuit depth.
GM-QAOA achieves better results than XM-QAOA on HUBO problems.
The resource-efficient GM-QAOA nearly matches fully optimized performance.
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is among leading candidates for achieving quantum advantage on near-term processors. While typically implemented with a transverse-field mixer (XM-QAOA), the Grover-mixer variant (GM-QAOA) offers a compelling alternative due to its global search capabilities. This work investigates the application of GM-QAOA to Higher-Order Unconstrained Binary Optimization (HUBO) problems, also known as Polynomial Unconstrained Binary Optimization (PUBO), which constitute a generalized class of combinatorial optimization tasks characterized by intrinsically multi-variable interactions. We present a comprehensive numerical study demonstrating that GM-QAOA, unlike XM-QAOA, exhibits monotonic performance improvement with circuit depth and achieves superior results for HUBO problems. An important component of our approach is an analytical framework for…
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 · Complexity and Algorithms in Graphs
