arXiv (All)
open access
CV-QAOA: Efficient Low-Depth Quantum Optimization of Continuous Variables
We study a Continuous-Variable Quantum Approximate Optimization Algorithm (CV-QAOA) for high-dimensional continuous optimization. Our formulation extends an earlier CV-QAOA proposal with a variationally optimized initial state and recovers the convergence guarantees of Quantum Hamiltonian Descent (Q
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Training Variational Quantum Algorithms Is NP-Hard, Even Locally#1201141
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Hybrid Variational Quantum Circuits for Multivariate Regression and High-Dimensional Data Reconstruction#1123724
- Hybrid Variational Quantum Circuits for Multivariate Regression and High-Dimensional Data Reconstruction#919386
- Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment#1076148
Record · ID 1215898
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive