arXiv (All)
open access
Fault-tolerant cost of shallow QAOA on near-symmetric optimization problems
Montanaro and Zhou proved that depth-one Quantum Approximate Optimization Algorithm (QAOA) finds the planted solution of certain near-symmetric constraint satisfaction problems with probability $Ω(1)$, and observed exponential runtimes for general-purpose classical solvers on explicit realizations,
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
- AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates#1013761
- A Distributed Quantum Approximate Optimization Algorithm For Unit Commitment#429321
- ZX-Calculus for Quantum Circuits : A Diagrammatic Approach to Quantum Circuit Analysis and Optimization / by Subhojit Halder#623859
- A quantum-assisted framework for PDE-based Bayesian inverse problems#780769
- A quantum-assisted framework for PDE-based Bayesian inverse problems#779394
Record · ID 1145089
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