arXiv (All)
open access
Sparse-Blossom Decoding in $o(1)$ Time
Matching-based decoding is widely used in quantum error correction, and accelerating it is key to enabling fast and scalable fault-tolerant quantum computation. Minimum-weight perfect matching (MWPM) decoding provides rigorous guarantees for error suppression, while sparse blossom enables its practi
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
- Real-time decoder for a MegaQuOp quantum computer using a single CPU#926193
- A framework of partial error correction for intermediate-scale quantum computers#798531
- A framework of partial error correction for intermediate-scale quantum computers#797118
- Distilling Datasets into Shallow Circuits for Quantum Machine Learning#1064773
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#792535
Record · ID 1000222
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