# Surface codes: Towards practical large-scale quantum computation

@article{Fowler2012SurfaceCT, title={Surface codes: Towards practical large-scale quantum computation}, author={Austin G. Fowler and M. Mariantoni and John M. Martinis and Andrew N. Cleland}, journal={Physical Review A}, year={2012}, volume={86}, pages={032324} }

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…

## Figures and Tables from this paper

figure 1 figure 10 figure 11 figure 12 figure 13 figure 14 figure 15 figure 16 figure 17 figure 18 figure 19 figure 2 figure 20 figure 21 figure 22 figure 23 figure 24 figure 25 figure 26 figure 27 figure 28 figure 29 figure 3 figure 30 figure 31 figure 32 figure 33 figure 34 figure 35 figure 4 figure 5 figure 6 figure 7 figure 8 figure 9 table I table II table III table IV table V table VI table VII

## 1,295 Citations

AutoBraid: A Framework for Enabling Efficient Surface Code Communication in Quantum Computing

- Computer ScienceMICRO
- 2021

This paper focuses on the compilation for fault-tolerant quantum hardware and provides a framework for efficiently scheduling braiding paths and discovers that for quantum programs with a local parallelism pattern, the framework guarantees an optimal solution, while the previous greedy-heuristic-based solution cannot.

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

- Computer Science, PhysicsQuantum
- 2019

No knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements, which are based on surface-code patches.

Realization of Surface Code Quantum Memory on Systems with Always-On Interactions.

- Physics
- 2019

We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The…

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

- Computer Science2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)
- 2020

This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total.

Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing

- Physics, Computer Science
- 2014

The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.

Fast universal logical gates on topologically encoded qubits at arbitrarily large code distances

- Computer Science
- 2018

This work demonstrates that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance by a constant depth local quantum circuit followed by a permutation of qubits, and reforms the notion of anyon braiding as an effectively instantaneous process, rather than as an adiabatic, slow process.

Silicon CMOS architecture for a spin-based quantum computer

- PhysicsNature Communications
- 2017

An architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology featuring a spin qubit surface code and individual qubit control via floating memory gate electrodes is proposed.

Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits.

- PhysicsPhysical review letters
- 2020

It is demonstrated that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order of the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits.

Implementing a strand of a scalable fault-tolerant quantum computing fabric.

- Physics, Computer ScienceNature communications
- 2014

High-fidelity parity detection of two code qubits via measurement of a third syndrome qubit is demonstrated and a measurement tomography protocol is developed to fully characterize this parity readout.

Simulation of the five-qubit quantum error correction code on superconducting qubits

- Computer Science, PhysicsPhysical Review A
- 2022

A circuit based on the minimal distance-3 QEC code, which requires only 5 data qubits and 5 ancilla qubits, connected in a ring with iSWAP gates implemented between neighboring qubits is proposed, showing that, thanks to its smaller footprint, the proposed code has a lower logical error rate than Surface-17 for similar physical error rates.

## References

SHOWING 1-10 OF 127 REFERENCES

Topological quantum memory

- Physics
- 2002

We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and…

A bridge to lower overhead quantum computation

- Computer Science, Physics
- 2012

This work addresses the second challenge of practical large-scale quantum computation, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code.

High-threshold universal quantum computation on the surface code

- Physics, Computer Science
- 2009

A comprehensive and self-contained simplified review of the quantum computing scheme of Phys.

Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)

- Physics
- 2005

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.…

Architecture for a large-scale ion-trap quantum computer

- Physics, Computer ScienceNature
- 2002

This work shows how to achieve massively parallel gate operation in a large-scale quantum computer, based on techniques already demonstrated for manipulating small quantum registers, and uses the use of decoherence-free subspaces to do so.

Implementing the Quantum von Neumann Architecture with Superconducting Circuits

- PhysicsScience
- 2011

A quantum central processing unit that exchanges data with a quantum random-access memory integrated on a chip, with instructions stored on a classical computer is demonstrated.

Noise threshold for a fault-tolerant two-dimensional lattice architecture

- Computer Science, PhysicsQuantum Inf. Comput.
- 2007

A model of quantum computation in which the set of operations is limited to nearest-neighbor interactions on a 2D lattice is considered, and it is shown that the additional SWAP operations required to move qubits in the local model affect the noise threshold only moderately.

Fault tolerant architectures for superconducting qubits

- Physics
- 2009

In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of…

Measurement-based quantum computation on cluster states

- Physics, Computer Science
- 2003

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster…

Latency in local, two-dimensional, fault-tolerant quantum computing

- Physics, Computer ScienceQuantum Inf. Comput.
- 2009

The latency of fault-tolerant quantum computing based on the 9-qubit Bacon-Shor code is analyzed using a local, two-dimensional architecture and the error threshold is improved to 2.02×10-5, when memory errors are taken to be one tenth of the gate error rates.