arXiv (OAI Expanded)
open access
Error-Adaptive Quasi-local Decoding of the Toric Code
Topological quantum memories need decoders that are both reliable and scalable, but these goals compete: globally informed decoders are accurate near threshold yet expensive, while strictly local rules are fast but can miss long-range structure. Motivated by recent recoverability and mixed-state vie
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
- Error-Adaptive Quasi-local Decoding of the Toric Code#781035
- Causal-Order Identification of Memoryless Sequential Quantum Processes from Restricted Projective Data#1011093
- Quantum Topological Data Analysis Beyond Betti Numbers: Complexity Hardness $\&$ An Algorithm for Torsion Witness#1064656
- Universality Sacrifices Reliability in Classical-Quantum Channel Coding#1157212
- Phase-cycled randomized benchmarking of quantum processors: recovering hidden classical noise correlations#974024
Record · ID 779660
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