Surface codes: Towards practical large-scale quantum computation
arXiv:1208.0928 · doi:10.1103/PhysRevA.86.032324
Abstract
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to stabilizers acting on a two-dimensional array of physical qubits, on which we implement the surface code. We next describe how logical qubits are formed in the surface code array and give numerical estimates of their fault-tolerance. We outline how logical qubits are physically moved on the array, how qubit braid transformations are constructed, and how a braid between two logical qubits is equivalent to a controlled-NOT. We then describe the single-qubit Hadamard, S and T operators, completing the set of required gates for a universal quantum computer. We conclude by briefly discussing physical implementations of the surface code. We include a number of appendices in which we provide supplementary information to the main text.
54 pages, 35 figures, version incorporating referee and community feedback. Additional comments welcome
References in corpus (9)
- Many-Body Physics with Ultracold Gases
- Quantum Computing
- Superconducting Circuits and Quantum Information
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- Quantum computing with nearest neighbor interactions and error rates over 1%
- A new quantum ripple-carry addition circuit
- A bridge to lower overhead quantum computation
- Architecture-Dependent Execution Time of Shor's Algorithm
Cited by in corpus (11)
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Novel constructions for the fault-tolerant Toffoli gate
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Surface code with decoherence: An analysis of three superconducting architectures
- Proof of finite surface code threshold for matching
- Distilling one-qubit magic states into Toffoli states
- Practicality of spin chain 'wiring' in diamond quantum technologies
- Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
- Quantum circuit optimization by topological compaction in the surface code
- Distillation protocols for Fourier states in quantum computing
- Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code