arXiv (All)
open access
Complexity Barriers to State Preparation in Quantum Approximate Optimization
For many important optimization problems we are restricted to approximate solutions in practice due to computational complexity. Distinct from the exact optimization setting, approximate optimization admits performance measures beyond whether the optimum is found, with different tradeoffs and comple
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
- Adaptive Differential Evolution and Multistart Search for Noisy QAOA Optimization#1048925
- Factorized Boolean representations for efficient quantum synthesis#819473
- Demonstration of efficient predictive surrogates for large-scale quantum processors.#239670
- Quantum-echo Markov process for combinatorial optimization#1143544
- Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits#1123108
Record · ID 1106219
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