Decoder Backlog in Real-Time Surface-Code Operation: Throughput, Latency and the Stability Condition

Error correction is a streaming problem. Every syndrome cycle, each measure qubit in every patch reports a bit, and a decoder must consume those bits at least as fast as the hardware produces them, or the backlog grows without bound and feedback arrives too late to matter. This paper prices the stream. A distance-twenty-seven patch emits 728 syndrome bits per microsecond-scale cycle, a rate of 728 megabits per second per patch; a machine of a thousand such patches produces syndrome data at hundreds of gigabits per second, all of it on a deadline. The stability condition is stated in its sharpest form: mean decoding time per round must sit below the cycle time, with headroom for the bursts that real decoders exhibit. Latency, distinct from throughput, is budgeted separately for the operations that need feedback, and the paper closes with the buffer arithmetic that converts a decoder's worst-case pause into the memory a control system must provision.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24245346
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Decoder Backlog in Real-Time Surface-Code Operation: Throughput, Latency and the Stability Condition

William Alexander Aldred
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Decoder Backlog in Real-Time Surface-Code Operation: Throughput, Latency and the Stability Condition

William Alexander Aldred
article en

Abstract

Error correction is a streaming problem. Every syndrome cycle, each measure qubit in every patch reports a bit, and a decoder must consume those bits at least as fast as the hardware produces them, or the backlog grows without bound and feedback arrives too late to matter. This paper prices the stream. A distance-twenty-seven patch emits 728 syndrome bits per microsecond-scale cycle, a rate of 728 megabits per second per patch; a machine of a thousand such patches produces syndrome data at hundreds of gigabits per second, all of it on a deadline. The stability condition is stated in its sharpest form: mean decoding time per round must sit below the cycle time, with headroom for the bursts that real decoders exhibit. Latency, distinct from throughput, is budgeted separately for the operations that need feedback, and the paper closes with the buffer arithmetic that converts a decoder's worst-case pause into the memory a control system must provision.

Zenodo (CERN European Organization for Nuclear Research)
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