Closing the loop on memory: accurate, shallow and transferable decoding of quantum LDPC codes

Quantum low-density parity-check (qLDPC) codes have attracted interest for fault-tolerant quantum computing because their high-rate constructions offer a route to reduced qubit overhead. Realizing this potential requires reliable decoding. Belief propagation (BP) forms the basis of many qLDPC decoders, but can fail to converge under circuit-level noise. Memory-based variants can improve convergence, yet selecting memory strengths that work reliably across different syndromes remains challenging. Here we introduce TEMPO-BP, which adapts each variable's memory strength to the evolving decoding state through local feedback. On the gross code at a physical error rate of 0.4%, single-run TEMPO-BP achieves a per-shot logical failure rate of 0.73%, compared with 2.51% for BP+OSD+CS-10. Ensembles of 10-15 concurrent instances match or lower failure counts relative to Relay-BP-5 at all ten tested operating points, with per-instance iteration caps at least tenfold lower than its serial limit. Without retuning, the gross-code parameters yield fewer observed failures than Relay-BP-5 in its published gross-code configuration across four additional code families. Ablations support state-dependent memory control, while a loop-gain analysis characterizes specific amplification modes in the decoding dynamics.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21086
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Closing the loop on memory: accurate, shallow and transferable decoding of quantum LDPC codes

Yuan Xiao, Zhou You, Ying Li, Yuan Yao
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Closing the loop on memory: accurate, shallow and transferable decoding of quantum LDPC codes

Yuan Xiao, Zhou You, Ying Li, Yuan Yao
preprint en

Abstract

Quantum low-density parity-check (qLDPC) codes have attracted interest for fault-tolerant quantum computing because their high-rate constructions offer a route to reduced qubit overhead. Realizing this potential requires reliable decoding. Belief propagation (BP) forms the basis of many qLDPC decoders, but can fail to converge under circuit-level noise. Memory-based variants can improve convergence, yet selecting memory strengths that work reliably across different syndromes remains challenging. Here we introduce TEMPO-BP, which adapts each variable's memory strength to the evolving decoding state through local feedback. On the gross code at a physical error rate of 0.4%, single-run TEMPO-BP achieves a per-shot logical failure rate of 0.73%, compared with 2.51% for BP+OSD+CS-10. Ensembles of 10-15 concurrent instances match or lower failure counts relative to Relay-BP-5 at all ten tested operating points, with per-instance iteration caps at least tenfold lower than its serial limit. Without retuning, the gross-code parameters yield fewer observed failures than Relay-BP-5 in its published gross-code configuration across four additional code families. Ablations support state-dependent memory control, while a loop-gain analysis characterizes specific amplification modes in the decoding dynamics.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon