Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Almost-linear time decoding algorithm for topological codes
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 5roles
background 1polarities
background 1representative citing papers
Block decoder for color codes yields (1+ε)-approx w.h.p. under i.i.d. and smoothed noise plus exact min-weight decoding in sparse low-p regime.
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
A randomized, locally-guided belief-propagation decoder breaks degeneracy deadlocks in quantum error correction, reducing logical error rate and expensive global-decoder invocations by orders of magnitude.
A benchmarking framework for hybrid quantum error correction shows belief propagation reduces weighted correction volume by 48-57% compared to MWPM-family decoders while preserving input sparsity.
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.
-
Average-Case and Smoothed Near-Optimality for Color-Code Decoding
Block decoder for color codes yields (1+ε)-approx w.h.p. under i.i.d. and smoothed noise plus exact min-weight decoding in sparse low-p regime.
-
Approximating optimal decoding of quantum LDPC codes with narrow frontiers
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
A randomized, locally-guided belief-propagation decoder breaks degeneracy deadlocks in quantum error correction, reducing logical error rate and expensive global-decoder invocations by orders of magnitude.
-
A Unified Hardware-to-Decoder Architecture for Hybrid Continuous-Variable and Discrete-Variable Quantum Error Correction in LiDMaS+
A benchmarking framework for hybrid quantum error correction shows belief propagation reduces weighted correction volume by 48-57% compared to MWPM-family decoders while preserving input sparsity.