Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization

Summarize this article with:
Quantum Physics arXiv:2605.06858 (quant-ph) [Submitted on 7 May 2026] Title:Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization Authors:Jose Falla, Ilya Safro View a PDF of the paper titled Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization, by Jose Falla and Ilya Safro View PDF HTML (experimental) Abstract:We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the Ising-type portfolio problem Hamiltonian and the Hamming weight-preserving XY mixer Hamiltonian into our variational ansatz, the resulting Constrained Counterdiabatic QAOA (CCD-QAOA) achieves improved optimization performance under realistic budget and risk constraints. Benchmarking against standard XY-mixer QAOA, Grover-mixer QAOA, and penalty-based QAOA formulations, our numerical simulations demonstrate that, for a fixed QAOA depth, our CCD-QAOA approach consistently results in better approximation ratios. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2605.06858 [quant-ph] (or arXiv:2605.06858v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.06858 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jose Falla [view email] [v1] Thu, 7 May 2026 18:57:42 UTC (2,241 KB) Full-text links: Access Paper: View a PDF of the paper titled Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization, by Jose Falla and Ilya SafroView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 References & Citations INSPIRE HEP NASA ADSGoogle 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?)
