Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Local active error correction from simulated con- finement
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
A new 2D signal-rule local decoder for the toric code achieves exponential logical error suppression below a threshold under phenomenological noise with data and measurement errors.
citing papers explorer
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
-
Local decoder for the toric code via signal exchange
A new 2D signal-rule local decoder for the toric code achieves exponential logical error suppression below a threshold under phenomenological noise with data and measurement errors.