A Complex-Valued Continuous-Variable Quantum Approximation Optimization Algorithm (CCV-QAOA)
Abstract Continuous-variable (CV) quantum systems offer a natural framework for continuous optimization through their infinite-dimensional Hilbert spaces. In this paper, we propose the Complex Continuous-Variable Quantum Approximate Optimization Algorithm (CCV-QAOA), a variational framework operating in the complex domain that optimizes over complex decision variables. The method efficiently solves real and complex multivariate optimization problems. To demonstrate its versatility, we apply CCV-QAOA across a broad suite of optimization use cases, including convex quadratic minimization, scaling studies with circuit depth and cutoff dimension, constrained quadratic programs using penalty constructions, and non-convex benchmarks such as the Styblinski–Tang function and complex quartic landscapes.
Authors
- Zeno Toffano (ORCID: https://orcid.org/0000-0001-8594-3291)
- Raneem Madani (ORCID: https://orcid.org/0009-0006-6757-0181)
- Abdel Lisser
Institutions
- Laboratoire des signaux et systèmes (FR)
Publication Details
- Journal
- Research Square
- Published
- 2026-11-17
- DOI
- https://doi.org/10.21203/rs.3.rs-11280102/v1
- Citations
- 1
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- preprint
Funders
- Agence Nationale de la Recherche