Recursive Quantum Alternating Operator Ansatz

Understand this faster with AI
Quantum Physics arXiv:2611.17537 (quant-ph) [Submitted on 12 Nov 2026] Title:Recursive Quantum Alternating Operator Ansatz Authors:Lennart Binkowski, Stuart Flannigan View a PDF of the paper titled Recursive Quantum Alternating Operator Ansatz, by Lennart Binkowski and 1 other authors View PDF HTML (experimental) Abstract:The recursive quantum approximate optimisation algorithm~(RQAOA) shrinks an unconstrained combinatorial optimisation problem by eliminating one variable at a time, guided by correlations measured in variational quantum states. We extend this recursion to constrained problems by building on the quantum alternating operator ansatz, which restricts the evolution to feasible solutions through a feasible initial state and feasibility-preserving mixers. However, every elimination alters the feasibility structure, so that such a mixer for the original problem generally fails to be one for the subproblems. Previous extensions to Maximum Independent Set and Minimum Vertex Cover sidestep this with tailored reduction rules that keep every subproblem within the original problem class. We resolve this by identifying, for a given constraint structure, a broader problem class that is closed under all eliminations, and by efficiently constructing feasible initial states and feasibility-preserving mixers for every class member. We do so for monotone constraints, such as for the knapsack problem, for linear equality constraints with polynomially bounded weights, including Hamming weight constraints, and for combinations of equality constraints with a single inequality constraint, such as the cardinality-constrained knapsack problem. Conversely, we show that these restrictions cannot be lifted in general without leaving the realm of efficient constructions. Exact simulations on knapsack and vertex-weighted max-bisection instances demonstrate that our recursive scheme can outperform both its non-recursive counterpart and penalty-based QAOA and RQAOA. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2611.17537 [quant-ph] (or arXiv:2611.17537v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.17537 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Lennart Binkowski [view email] [v1] Thu, 12 Nov 2026 21:48:41 UTC (79 KB) Full-text links: Access Paper: View a PDF of the paper titled Recursive Quantum Alternating Operator Ansatz, by Lennart Binkowski and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 References & Citations INSPIRE HEP SciXGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
