Pith. sign in

REVIEW 17 cited by

Demonstrating real-time and low-latency quantum error correction with superconducting qubits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.05202 v1 pith:FSFKVEY6 submitted 2024-10-07 quant-ph

Demonstrating real-time and low-latency quantum error correction with superconducting qubits

classification quant-ph
keywords decodingquantumdemonstratinglogicalerrorlow-latencyreal-timerounds
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to $25$ decoding rounds and a mean decoding time per round below $1$ ${\mu}s$, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of $9.6$ ${\mu}s$ for a total of $9$ measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 17 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop

    quant-ph 2026-07 conditional novelty 7.0 partial

    In windowed quantum decoding, a wrong speculative boundary guess stays inside one window, and the predict-verify-recover loop removes the serial stall with negligible penalty.

  2. A superconducting surface-code processor with lattice-surgery logical operations

    quant-ph 2026-06 unverdicted novelty 7.0

    Experimental realization of lattice surgery on two d=3 surface-code logical qubits in superconducting hardware, with logical Bell state, Deutsch-Jozsa algorithm, and conditioned non-Clifford gate fidelity of 0.943.

  3. Syndrome resampling enhances quantum error correction thresholds

    quant-ph 2026-05 unverdicted novelty 7.0

    Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.

  4. Quantum Error-Corrected Computation of Molecular Energies

    quant-ph 2025-05 conditional novelty 7.0

    First end-to-end demonstration of quantum error correction integrated with quantum phase estimation to compute molecular hydrogen ground-state energy to 0.001(13) hartree accuracy on Quantinuum H2-2 hardware.

  5. Complementary 3D color codes for transversal quantum logic

    quant-ph 2026-07 conditional novelty 6.5

    Complementary tetrahedral and H-tetrahedral 3D color codes supply transversal magic and most entanglement; a pieceable round-robin CZ with 2D Steane extraction completes a universal FT gate set.

  6. Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers

    quant-ph 2026-07 conditional novelty 6.0

    Partially fault-tolerant [[4,2,2]] Iceberg-code simulations on ibm_boston improve local Ising observables over unencoded baselines by a few percent in 1D and over 200% in 2D at late times via Observable-Ranked Postselection.

  7. Toward Covert Quantum Computing

    quant-ph 2026-05 conditional novelty 6.0

    The paper defines covert quantum computing via quantum strategies, proves O(sqrt(n)) border qubits suffice for detection in planar n-qubit circuits with nearest-neighbor crosstalk, and experimentally detects additiona...

  8. Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder

    quant-ph 2026-05 unverdicted novelty 6.0

    An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.

  9. Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation

    quant-ph 2026-05 unverdicted novelty 6.0

    Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.

  10. O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling

    quant-ph 2026-04 unverdicted novelty 6.0

    O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.

  11. QAdapt: A Noise-Adaptive Neural Pre-Decoding Framework for Quantum Error Correction

    cs.LG 2026-07 conditional novelty 5.0

    A continually adapted neural pre-decoder reduces logical error rate and residual matching latency versus a fixed neural baseline across 110 OOD noise settings and zero-shot on Willow.

  12. Low-Overhead Error-Corrected QCNNs Using Bivariate Bicycle Codes

    cs.LG 2026-07 conditional novelty 5.0

    Distance-4 bivariate bicycle codes plus an interleaved feed-forward decoder give a 29-physical-qubit encoding of a 4-qubit QCNN that is more noise-resilient than the bare circuit at 0.1% error rates.

  13. A Cryogenic Hybrid Photonic/CMOS Controller Architecture for Scalable Superconducting Qubit Control

    quant-ph 2026-06 unverdicted novelty 5.0

    A 4 K hybrid photonic/CMOS controller distributes optical pulse templates while using local Cryo-CMOS for amplitude, phase, and timing control to reduce per-channel dissipation and enable scalable qubit gates.

  14. Impact of control signal phase noise on qubit fidelity

    quant-ph 2026-01 unverdicted novelty 5.0

    Simulations identify specific frequency bands of phase noise in control signals as the main drivers of qubit fidelity loss, with an approximate analytical picture of their contributions.

  15. Real-Time Quantum Error Correction System Stack: Architecture, Algorithms, and Engineering Practice

    quant-ph 2026-05 unverdicted novelty 4.0

    A white paper proposing a six-layer system stack for real-time quantum error correction, with benchmarks of decoders for surface and qLDPC codes and latency models.

  16. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 4.0

    The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.

  17. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 3.0

    The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.