Abstract

This article provides an introduction to surface code quantum computing. We\nfirst estimate the size and speed of a surface code quantum computer. We then\nintroduce the concept of the stabilizer, using two qubits, and extend this\nconcept to stabilizers acting on a two-dimensional array of physical qubits, on\nwhich we implement the surface code. We next describe how logical qubits are\nformed in the surface code array and give numerical estimates of their\nfault-tolerance. We outline how logical qubits are physically moved on the\narray, how qubit braid transformations are constructed, and how a braid between\ntwo logical qubits is equivalent to a controlled-NOT. We then describe the\nsingle-qubit Hadamard, S and T operators, completing the set of required gates\nfor a universal quantum computer. We conclude by briefly discussing physical\nimplementations of the surface code. We include a number of appendices in which\nwe provide supplementary information to the main text.\n

Keywords

Scale (ratio)ComputationSurface (topology)Computer scienceQuantumComputational scienceStatistical physicsPhysicsMathematicsAlgorithmQuantum mechanicsGeometry

Affiliated Institutions

Related Publications

Publication Info

Year
2012
Type
article
Volume
86
Issue
3
Citations
2755
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

2755
OpenAlex

Cite This

Austin G. Fowler, M. Mariantoni, John M. Martinis et al. (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A , 86 (3) . https://doi.org/10.1103/physreva.86.032324

Identifiers

DOI
10.1103/physreva.86.032324