arXiv (All)
open access
Scaling Quantum Optimization to the Thousand-Qubit Scale with Distributed Quantum Sampling
The Minimum Birkhoff Decomposition (MBD) seeks a sparse weighted sum of matchings and is a challenging optimization problem with applications in network scheduling and energy trading. We scale a quantum-assisted decomposition method by combining single-layer QAOA sampling with Extended Fully-Correct
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
- Beyond QAOA: A Review of AI and Quantum Computing for Adaptive Combinatorial Optimization#1249039
- Quantum Sampling of Random Spanning Trees via Amortized Data Structures#1154574
- Optimal Linear-Rate Conversion of Unknown Mixed Qubit States via SWAP Tests#1123682
- Learning parameter curves in feedback-based quantum optimization algorithms#1144750
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#792535
Record · ID 1247699
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