Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, M. Mariantoni, John M. Martinis et al. · Physical Review A · 2012
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, $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{S}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{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.
Cited by 3,042 works. doi:10.1103/physreva.86.032324 Open-access PDF
Authors
References
- Quantum Computation and Quantum Information
- Quantum computation and quantum information
- Paths, Trees, and Flowers
- Scheme for reducing decoherence in quantum computer memory
- Maximum matching and a polyhedron with 0,1-vertices
- Quantum Mechanics Helps in Searching for a Needle in a Haystack
- Fault-tolerant quantum computation by anyons
- Modern Quantum Mechanics
- Many-body physics with ultracold gases
- Multiple-particle interference and quantum error correction