Surface codes: Towards practical large-scale quantum computation

TL;DR

This paper introduces surface code quantum computing, explaining how logical qubits are formed, manipulated, and fault-tolerant, and discusses physical implementation prospects for large-scale quantum computers.

Contribution

It provides a comprehensive introduction to surface code quantum computing, including logical qubit construction, fault-tolerance estimates, and implementation considerations.

Findings

Logical qubits can be reliably formed and manipulated in surface codes.

Surface codes enable fault-tolerant quantum operations with estimated thresholds.

Discussion of physical implementations suggests practical pathways for large-scale quantum computers.

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.