Threshold error rates for the toric and surface codes
arXiv:0905.0531
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.
arXiv comment14 pages, 11 figures
References in corpus (10)
- Fault-tolerant quantum computation by anyons
- Good Quantum Error-Correcting Codes Exist
- Quantum Computing with Very Noisy Devices
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- High threshold universal quantum computation on the surface code
- Quantum codes on a lattice with boundary
- Accuracy threshold for concatenated error detection in one dimension
- Mesoscopic superpositions of states - approach to classicality and diagonalization in coherent state basis
- Latency in local, two-dimensional, fault-tolerant quantum computing
Cited by in corpus (10)
- Quantum Error Correction for Beginners
- Scalable Architecture for a Room Temperature Solid-State Quantum Information Processor
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Constructions and Noise Threshold of Topological Subsystem Codes
- Thresholds for the distributed surface code in the presence of memory decoherence
- Topological quantum error correction in the Kitaev honeycomb model
- Convolutional neural network based decoders for surface codes
- Artificial Neural Network Syndrome Decoding on IBM Quantum Processors
- Graphical algorithms and threshold error rates for the 2d colour code
- Efficient decoding of random errors for quantum expander codes