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
Signed reviews
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.
Forward citations
Cited by 17 Pith papers
-
Decoding across transversal Clifford gates in the surface code
A new logical-observable matching decoder lets surface codes run fast transversal Clifford gates while correcting all errors below half the code distance, and windowed variants trade efficiency against reset speed.
-
The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop
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.
-
Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware
Directional codes are new quantum LDPC codes whose stabilizer checks run on square or hexagonal grids via iSWAP swaps, matching rotated surface code logical error rates with about a quarter to a half of the physical qubits.
-
Scalable decoding protocols for fast transversal logic in the surface code
The paper presents windowed decoding protocols that restore modularity and locality to decoding of fast transversal logic, enabling constant-time logical gates with scalable error correction.
-
Complementary 3D color codes for transversal quantum logic
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.
-
Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers
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.
-
Measurement-and Feedback-Driven Non-Equilibrium Phase Transitions on a Quantum Processor
A 30-qubit superconducting processor with fast mid-circuit measurement and feedback observes an absorbing-state transition in directed-percolation universality and a separate, lower-rate measurement-induced entangleme...
-
Efficient Post-Selection for General Quantum LDPC Codes
Cluster-size and cluster-LLR norm fractions from BP+LSD decoding suppress logical error rates by orders of magnitude at low abort rates on surface, bivariate bicycle, and hypergraph product codes.
-
Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting
An iterative reweighting decoder for surface codes uses X-Z error correlations from circuit-level noise, improving logical error rates and raising the threshold from about 1% to 1.16%.
-
RISC-Q: A Generator for Real-Time Quantum Control System-on-Chips Compatible with RISC-V
RISC-Q is an open-source, parameterizable generator for building RISC-V-based quantum control chips, demonstrated on a ZCU216 board at 500 MHz with 16 DACs.
-
Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
A recurrent transformer decoder trained on circuit-level noise beats BP-OSD on the [[72,12,6]] bivariate bicycle code in logical error rate and runtime consistency, but falls behind on the [[144,12,12]] code.
-
Learning Feedback Mechanisms for Measurement-Based Variational Quantum State Preparation
A variational protocol that learns measurement-and-feedback strategies prepares AKLT states with less pre-measurement entanglement than the analytic Smith et al. protocol and discovers a protocol for a specific AKLT e...
-
QAdapt: A Noise-Adaptive Neural Pre-Decoding Framework for Quantum Error Correction
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.
-
Low-Overhead Error-Corrected QCNNs Using Bivariate Bicycle Codes
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.
-
Impact of control signal phase noise on qubit fidelity
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.
-
Dynamical codes for hardware with noisy readouts
Repeating measurement rounds in dynamically condensed colour codes substantially reduces teraquop volume under measurement-biased noise, while decoder choice determines whether XZ-only or XYZ schedules win.
-
Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
A NERSC analysis finds that more than 50% of its workload could ultimately benefit from quantum computing and that vendor roadmaps and quantum application requirements are projected to overlap in the next 5 to 10 years.
Discussion (0). Continue with ORCID to comment.