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.
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.
Real-time quantum error correction requires a classical decoder to consume syndrome measurements at the rate the quantum hardware produces them, roughly one round per microsecond on superconducting devices. The standard stability requirement is a utilization condition: the mean decode time per round must be less than the round period, ρ < 1. We show that this condition is inadequate for windowed decoders whose per-window cost grows superlinearly in the number of detection events, which is the empirical shape of matching-based decoders under burst-like syndrome content. For this class, stability is not a threshold but a basin. The deterministic backlog dynamics have a stable operating point and an unstable boundary B∗. Noise erodes that boundary downward, and sufficiently superlinear decoders escape spontaneously. In discrete-event simulations paired under common random numbers, a decoder with cost exponent γ = 1.5 and mean utilization ρ0 = 0.6 (forty percent nominal headroom) fails without provocation, with a mean time to failure of 1,344 ± 289 rounds, about 1.3ms of wall clock at a 1µs cycle. We measure the cost exponent of a production decoder (PyMatching 2, sparse blossom) and find it anisotropic: near-linear (γ ≈ 1.1–1.2) when a window grows in length at fixed syndrome density, but approximately quadratic (γ ≈ 2) when the same window grows denser. Bursts travel along the dangerous axis, where the basin is 2–4 rounds deep for ρ0 between 0.5 and 0.8. Spatially clustered event content, the syndrome footprint of leakage and cosmic-ray bursts, is worse still: at matched event count, clustered windows cost 7.6× length-grown ones and 4.8× uniformly densified ones, so the quadratic density exponent is a conservative proxy for burst content. Greedy catch-up (“decode everything queued”) is precisely the divergent policy. A bounded decoding window restores stability, and the measured stability edge lands on a closed-form line. The simulation model is cross-validated against Stim at the level of individual fault mechanisms.
Real-time quantum error correction requires a classical decoder to consume syndrome measurements at the rate the quantum hardware produces them, roughly one round per microsecond on supercon-ducting devices. The standard stability requirement is a utilization condition: the mean decode time per round must be less than the round period, ρ < 1. We show that this condition is inadequate for windowed decoders whose per-window cost grows superlinearly in the number of detection events, which is the empirical shape of matching-based decoders under burst-like syndrome content. For this class, stability is not a threshold but a basin. The deterministic backlog dynamics have a stable operating point and an unstable boundary B∗. Noise erodes that boundary downward, and sufficiently superlinear decoders escape spontaneously. In discrete-event simulations paired under common random numbers, a decoder with cost exponent γ = 1.5 and mean utilization ρ0 = 0.6 (forty percent nominal headroom) fails without provocation, with a mean time to failure of 1,344 ± 289 rounds, about 1.3 ms of wall clock at a 1 μs cycle. These Poisson times are upper bounds: modulating the arrival rate at fixed mean load shortens them monotonically with the measured dispersion index of the arrivals, fourfold by D ≈ 3, and a dispersion excess of twelve percent already uncensors the ρ0 = 0.5 ensemble. We measure the cost exponent of a production decoder (PyMatching 2, sparse blossom) and find it anisotropic: near-linear (γ ≈ 1.1–1.2) when a window grows in length at fixed syndrome density, but approximately quadratic (γ ≈ 2) when the same window grows denser. Bursts travel along the dangerous axis, where the basin is 2–4 rounds deep for ρ0 between 0.5 and 0.8. Spatially clustered event content, the syndrome footprint of leakage and cosmic-ray bursts, is worse still: at matched event count, clustered windows cost 7.6× length-grown ones and 4.8× uniformly densified ones, so the quadratic density exponent is a conservative proxy for burst content. The anisotropy is a property of the matching class rather than of one implementation, since a second exact-MWPM decoder reproduces the density exponent, while a BP+OSD decoder is nearly event-independent: no basin, but orders of magnitude more cost per window. The basin is the price of event-adaptive decoding. Greedy catch-up (“decode everything queued”) is precisely the divergent policy. A bounded decoding window restores stability, and the measured stability edge lands on a closed-form line. The rule survives finite memory: under greedy service a queue cap acts as an implicit window, and a cap on the unstable side of the same line pins at the cap and sheds rounds indefinitely, so adding buffer memory makes the greedy policy strictly worse. The simulation model is cross-validated against Stim at the level of individual fault mechanisms.
Surface codes are a popular error-correction route to fault-tolerant quantum computation. The so-called exponential backlog problem that can arise when one has to do logical T-gates within the surface code demands real-time decoding of the syndrome information to diagnose the appropriate Pauli frame in which to do the gate. This in turn puts a minimum requirement on the communication rate between the quantum processing unit, where the syndrome information is collected, and the classical processor, where the decoding algorithm is run. This minimum communication rate can be difficult to achieve while preserving the quality of the quantum processor. Here, we present two decoders that make use of a reduced syndrome information volume, relying on a number of syndrome bits that scale only as the width -- and not the usual area -- of the surface-code patch. This eases the communication requirements necessary for real-time decoding.
Quantum error correction (QEC) is transitioning from physical feasibility demonstrations to systems engineering challenges. Google has achieved below-threshold performance on distance-5/7 surface codes, while Riverlane and Rigetti have demonstrated hardware-integrated low-latency feedback loops. These milestones indicate that the core challenge of real-time decoding has shifted from algorithmic capability to system-level engineering. However, a substantial engineering gap remains between laboratory demonstrations and scalable fault-tolerant quantum computing (FTQC). This white paper addresses three questions: (1) Where are the real bottlenecks in real-time QEC: beyond average decoder speed, the constraints lie in QEC round time, tail latency, and end-to-end data path coordination; (2) How mature are mainstream decoder algorithms: we benchmark the major decoders for both surface codes and quantum low-density parity-check (qLDPC) codes, evaluating their real-time readiness; (3) What system stack do we propose: a six-layer reference architecture from syndrome acquisition to logical operations, with interface definitions and latency budget models. Our results quantify the gap between current decoder performance and real-time requirements, and identify the architectural choices needed to close it.
A fault-tolerant quantum computer must continuously decode a stream of syndrome data, yet the computational work required by each decoding window is random. Although average throughput determines whether the syndrome backlog is stable (doesn’t grow without bound), it does not determine the buffer capacity needed to meet a target overflow probability. Here, we model syndrome buffering as a queue and show how its required depth depends on the tail of the decoding-work distribution. For heavy-tailed work, established queueing results imply that sliding-window decoding can require buffer depths that grow superpolynomially in the logarithm of the inverse overflow probability. Parallel-window decoding suppresses the overflow tail through concurrent service, with the suppression exponent determined by the number of spare decoders; under out-of-order release, the number of spare decoders required for a fixed buffer and target overflow probability grows logarithmically with the inverse target probability. We find evidence of heavy-tailed decoding work in Relay-BP on the gross-code and minimum-weight perfect matching on the surface code. These results identify syndrome-buffer capacity and memory-release policy as important design considerations for real-time quantum error correction.
Quantum error correction (QEC) is essential for achieving low error rates required for fault-tolerant quantum computation. In stabilizer-based codes such as the surface code, errors are inferred from repeated syndrome measurements and corrected by a classical decoder. To prevent error accumulation, decoding must be performed with both high throughput and low latency to keep pace with the QEC cycle and enable real-time feedback for universal logical operations. Here we report a hardware-integrated control architecture featuring an FPGA-based neural-network (NN) decoder and experimentally demonstrate real-time surface-code (distance-3) QEC on a superconducting quantum processor. The system achieves a deterministic closed-loop latency of 550 ns, including 124 ns for NN decoding, enabling feedback corrections within a 1.25 us QEC cycle. We show that real-time decoding and feedback correction achieve logical performance comparable to offline decoding while maintaining robustness against varying error conditions. We further demonstrate mid-circuit feedback correction in non-Clifford logical circuits, where Pauli-frame updating alone becomes insufficient. Our results establish a low-latency hardware architecture for embedded QEC control and provide a pathway towards scalable fault-tolerant quantum computing systems.