Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of
Λ=2.14±0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of
2.4±0.3 . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or
3 × 109 cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
Model calculation (SIMULATED, NOT MEASURED) of the energy budget of quantum error correction for a rotated surface-code architecture. At a physical error rate of 0.001 per operation, reaching a logical error probability of 1e-12 per syndrome cycle requires code distance 27 and 1457 physical qubits per logical qubit. Combining the cryogenic load, evaluated with the refrigerator coefficient-of-performance penalty at 4 K and at 15 mK, with room-temperature control and decoding power gives 3.94 W per physical qubit, 5741 W per logical qubit, and 0.155 J per logical operation at a 1 microsecond syndrome cycle time. This is an overhead of about 7.7e9 relative to a practical classical operation at 20 pJ. Room-temperature control and decoding dominate the budget. All numbers are produced by the deposited computation script.
We propose a novel method to calculate logical error rates in surface codes, assuming independent and identically distributed physical errors. These results fit well known scaling laws for studied physical error rates and code distances, but break down in some other regimes. Increasing the code distance still reduces logical error rates, but returns diminish quickly beyond a certain point. We show how to use our method to analyze hypothetical quantum computers with various configurations and select designs with lower error rates. Currently, this requires expensive classical simulations of quantum decoders for various distances and physical error rates or inaccurate extrapolation from minimal experimental data. Instead, we use the symmetry of the problem to count the configurations that result in a logical error with our novel software. Given a physical error rate, we can deduce the probability of a logical error to provably good accuracy quickly. We include an analysis of measurement errors to allow for a more complete comparison of different surface code implementations. We extend this counting method to a particular locally-correlated error model and another globally-correlated error model.
In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical error rate is reduced with a magnitude depending on the proximity of the physical error rate to the accuracy threshold of the code. We also briefly discuss an averaged approach with local information for table lookup and localized decoding schemes, an expected breakdown of these effects for large-scale systems, and the importance of this resource reduction in the near term.
Practical quantum computing requires error rates much lower than those achievable with physical qubits. Surface codes provide a reliable method to implement logical qubits using physical qubits. However, when these physical qubits are transmitted within quantum networks, their error rates can vary due to differences in the routing paths. Our experimental results indicate that the geometric arrangement of these physical qubits within a surface code significantly impacts its logical error rate. In this paper, we address this issue by proposing disparity surface codes, which are a group of geometric configurations for surface codes that adapt them for transmission within quantum networks. For a distance-
ddisparity surface code, only
dphysical qubits need to be transmitted with low error rates, and we identify multiple equivalent choices for selecting these
dqubits. Additionally, we propose Di-MWPM, a new decoder designed to exploit physical error rate disparity for enhanced error correction. Results demonstrate that disparity surface codes maintain favorable performance in different network scenarios, even under high noise conditions. Our Di-MWPM decoder achieves improved Pauli-error thresholds.
Quantum error correction (QEC) is indispensable for building scalable fault-tolerant quantum computers. Effective QEC demands stringent real-time decoding: the decoder must process syndrome measurements and determine corrections within a time scale--typically on the order of microseconds, to avoid data backlog. Scaling to large number of logical qubits further necessitates significant computational resources. In this work, we propose an architecture, called \emph{THQLink}, for real-time decoding of quantum error correction codes using high-performance computing (HPC) resources. The network connecting the HPC and the control system of quantum processing unit (QPU) is built on TH-Express and can be adapted to different quantum technologies and their associated control stacks. We report a round-trip latency of 2.944
μs on average, with an incremental overhead of 130 ns per additional hop. Using a parallel window strategy, we demonstrate real-time decoding (1
μs per QEC round) of the surface code up to distance 19 using a matching-based decoder on CPUs. Our work presents a scalable framework for real-time decoding in fault-tolerant quantum computing. It can be readily applied to quantum-centric supercomputers that feature tight integration between QPU and HPC resources, thereby enabling efficient support for hybrid quantum-classical algorithms and computation-intensive workloads offloaded from the QPU.