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
- William Alexander Aldred (ORCID: https://orcid.org/0009-0000-1215-577X)
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