Fault-tolerant quantum computation with high threshold in two dimensions.

By Robert Raussendorf, J. Harrington. Physical Review Letters, 2006

717 citations recorded by the source corpus.

We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage, and measurement errors.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/82315c882a599207f74325634a533d85446f10fd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

Citations in the corpus

Realizing repeated quantum error correction in a distance-three surface code (2021, background): “The number of required cycles scales in general with d in planar architectures and in architectures allowing for transversal execution of logical two-qubit gates [5, 6, 23, 52, 53].”
Suppressing quantum errors by scaling a surface code logical qubit (2022, neutral): “Related methods have long been used for accuracy threshold calculations [35, 86–92] and non-Pauli errors [93], and even for simulating circuits with a small fraction of non-Cliﬀord gates[94, 95].”
The future of quantum computing with superconducting qubits (2022, background): “The 2D surface code 8,9 has so far been considered an uncontested leader in terms of the error thresh-old—close to 1% for the commonly studied depolarizing noise 48–50 —yet has two important shortcomings.”
Quantum computers (2010, positive): “Such concepts are used to define remarkably powerful fault-tolerant QEC schemes among ordinary qubits 102 , but have also been proposed as a method of physical computation should appropriate hardware be found.”
Fusion-based quantum computation (2021, neutral): “Classical signals from fusion measurements (5)”
The XZZX surface code (2020, methodology): “Because our decoder is based on minimum-weight 584 matching, there are no fundamental obstacles to adapt it 585 to the more complex setting of circuit noise [40, 49, 60].”
Almost-linear time decoding algorithm for topological codes (2017, background): “rett and Stace [56, 5] first introduced an algorithm to decode the Raussendorf lattice [52, 53, 51] in the presence of erasure, which combines MWPMwith geometric deformations of the lattice around erased qubits, and runs in O(n3) time.”
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation (2009, background): “The gadgets presented in this paper assume we can perform gates between arbitrary pairs of qubits, but it is also possible to devise gadgets which only involve nearest-neighbor interactions in one or two dimensions [ 1, 23, 38, 50, 51 ].”
Quantum computing and the entanglement frontier (2012, background): “40,46 There are many challenges to making large-scale fault-tolerant quantum computing practical, including serious systems engineering issues.”
Measurement-based quantum computation (2009, methodology): “A topological method of fault tolerance can then be achieve”
Halving the cost of quantum addition (2017, background): “n+ O(1), an out-of-place adder that can be uncomputed without using T gates, and discuss some other constructions whose T-count is improved by the temporary logical-AND. Introduction The surface code [5,8,21,22,11] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubi”