Related Experiment Video
Updated: Sep 22, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Realizing repeated quantum error correction in a distance-three surface code
Sebastian Krinner1, Nathan Lacroix2, Ants Remm2
1Department of Physics, ETH Zurich, Zurich, Switzerland. skrinner@phys.ethz.ch.
Abstract:
Quantum computers hold the promise of solving computational problems that are intractable using conventional methods1. For fault-tolerant operation, quantum computers must correct errors occurring owing to unavoidable decoherence and limited control accuracy2. Here we demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors3-6. Using 17 physical qubits in a superconducting circuit, we encode quantum information in a distance-three logical qubit, building on recent distance-two error-detection experiments7-9. In an error-correction cycle taking only 1.1 μs, we demonstrate the preservation of four cardinal states of the logical qubit. Repeatedly executing the cycle, we measure and decode both bit-flip and phase-flip error syndromes using a minimum-weight perfect-matching algorithm in an error-model-free approach and apply corrections in post-processing. We find a low logical error probability of 3% per cycle when rejecting experimental runs in which leakage is detected. The measured characteristics of our device agree well with a numerical model. Our demonstration of repeated, fast and high-performance quantum error-correction cycles, together with recent advances in ion traps10, support our understanding that fault-tolerant quantum computation will be practically realizable.
Related Concept Videos
Propagation of Uncertainty from Random Error
Propagation of Uncertainty from Systematic Error
Distance Corrections
Detection of Gross Error: The Q Test
NMR Spectrometers: Resolution and Error Correction
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...

