Reducing Decoding Latency in Quantum Error Correction by Early Starting Clustering
quant-ph
Submitted: 2026-09-14
Updated: 2026-09-17
Terminology
Sources
- Low overhead quantum computation using lattice surgery
- Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
- Magic state cultivation: growing T states as cheap as CNOT gates
- Magic state cultivation on a superconducting quantum processor
- A superconducting surface-code processor with lattice-surgery logical operations
- Surface code logical operations on a superconducting quantum processor
- The Fast for the Curious: How to accelerate fault-tolerant quantum applications
- A scalable and real-time neural decoder for topological quantum codes
- Hierarchical decoding to reduce hardware requirements for quantum computing
- Real-time decoding of the gross code memory with FPGAs
- Modular decoding: parallelizable real-time decoding for quantum computers
- Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise
- Even More Efficient Soft-Output Decoding with Extra-Cluster Growth and Early Stopping
- PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity