Threshold error rates for the toric and surface codes
read the original abstract
The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correction procedure for the toric and surface codes, which is based on polynomial-time graph matching techniques and is efficiently implementable as the classical feed-forward processing step in a real quantum computer. By direct simulation of this error correction scheme, we determine the threshold error rates for the two codes (differing only in their boundary conditions) for both ideal and non-ideal syndrome extraction scenarios. We verify that the toric code has an asymptotic threshold of p = 15.5% under ideal syndrome extraction, and p = 7.8 10^-3 for the non-ideal case, in agreement with prior work. Simulations of the surface code indicate that the threshold is close to that of the toric code.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models
FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly...
-
PAEMS: Precise and Adaptive Error Model for Superconducting Quantum Processors
PAEMS is a new adaptive qubit error model that reduces timelike, spacelike, and spacetime error correlations by 19.5×, 9.3×, and 5.2× on IBM QPUs while outperforming Google's SI1000 model by 58-73% across multiple platforms.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above...
-
FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models
FTPrimitiveBench is an open-source pipeline that connects parameterized hardware-motivated noise models to surface-code logical primitive circuits, enabling reproducible cross-primitive QEC benchmarking under Pauli bi...
-
Convolutional neural network based decoders for surface codes
Convolutional neural network decoders achieve good performance on surface code error correction and adapt across noise models, with explainable AI used to inspect their decisions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.