Pith. sign in

Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation

11 Pith papers cite this work. Polarity classification is still indexing.

11 Pith papers citing it
abstract

Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have recently emerged as a promising route to efficient fault tolerance, current decoding algorithms do not allow one to realize the full potential of these codes in practical settings. Here, we introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes, and use it to probe a novel "waterfall" regime of error suppression, demonstrating that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes at current physical error rates, and with latencies within the real-time budgets of several leading hardware platforms. For example, for the $[144, 12, 12]$ Gross code, the decoder achieves logical error rates up to $\sim 17$x below existing decoders - reaching logical error rates $\sim 10^{-10}$ at physical error $p=0.1\%$ - with 3-5 orders of magnitude higher throughput. This decoder also produces well-calibrated confidence estimates that can significantly reduce the time overhead of repeat-until-success protocols. Taken together, these results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 11

years

2026 11

roles

background 1

polarities

background 1

representative citing papers

Machine Learning Optimal Quantum Error Correction Thresholds

quant-ph · 2026-06-20 · unverdicted · novelty 6.0

Transformer neural networks estimate coherent information thresholds for the surface code under code capacity, phenomenological, and circuit-level noise, outperforming minimum weight perfect matching decoding and enabling optimal soft post-selection.

Approximating optimal decoding of quantum LDPC codes with narrow frontiers

quant-ph · 2026-06-18 · unverdicted · novelty 6.0

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.

Untangling QLDPC Codes with Biased Noise Ancilla

quant-ph · 2026-06-29 · unverdicted · novelty 4.0

Biased-noise ancillas (phase flips only) in bicycle bivariate and cyclic hypergraph product QLDPC codes increase effective fault distance, reduce short loops, and improve logical error rate by nearly 10x at 2e-3 circuit noise when bit flips are 50x rarer.

citing papers explorer

Showing 11 of 11 citing papers.