arXiv (All)
open access
Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
and-sciencecomputational-complexitycomputational-engineeringdiscrete-mathematicsfinancemathematical-physicsquantum-physics
We study the feasibility limitations of generic QAOA for permutation-constrained optimization, where valid configurations occupy an exponentially small fraction of the Boolean hypercube. Using random edge-cost TSP/ATSP ensembles, we establish high-probability bounds showing that optimized generic QA
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
- On Diverse Solutions to Max-k-CSP and Bounded Degree k-SAT#1117868
- Quantum ordinal optimization under a fixed comparison budget#1327041
- On Partial Optimality in QUBO via Quadratic Posiform Autarkies#1355273
- Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs#1357060
- Pointer Networks with Q-Learning for Combinatorial Optimization#612712
Record · ID 1354106
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