CV-QAOA: Efficient Low-Depth Quantum Optimization of Continuous Variables
quant-ph, cs.DS
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: 40+41 pages, 9 figures
Project page: https://jiaqileng.github.io/quantum-hamiltonian-descent/nonconvex2d.html
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- A Quantum Approximate Optimization Algorithm for continuous problems
- A quantum-classical performance separation in nonconvex optimization
- Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
- Quantum Hamiltonian Descent
- Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
- A Quantum Approximate Optimization Algorithm
- On Speedups for Convex Optimization via Quantum Dynamics
- (Sub)Exponential Quantum Speedup for Optimization
- Fast Convex Optimization with Quantum Gradient Methods
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians