High-threshold universal quantum computation on the surface code

Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski
Phys. Rev. A 80, 052312 – Published 11 November 2009; Erratum Phys. Rev. A 87, 019905 (2013)

Abstract

We present a comprehensive and self-contained simplified review of the quantum computing scheme of Raussendorf et al. [Phys. Rev. Lett. 98, 190504 (2007); N. J. Phys. 9, 199 (2007)], which features a two-dimensional nearest-neighbor coupled lattice of qubits, a threshold error rate approaching 1%, natural asymmetric and adjustable strength error correction, and low overhead arbitrarily long-range logical gates. These features make it one of the best and most practical quantum computing schemes devised to date. We restrict the discussion to direct manipulation of the surface code using the stabilizer formalism, both of which we also briefly review, to make the scheme accessible to a broad audience.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
21 More
  • Received 16 July 2009

DOI:https://doi.org/10.1103/PhysRevA.80.052312

©2009 American Physical Society

Erratum

Erratum: High-threshold universal quantum computation on the surface code [Phys. Rev. A 80, 052312 (2009)]

Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski
Phys. Rev. A 87, 019905 (2013)

Authors & Affiliations

Austin G. Fowler1, Ashley M. Stephens1, and Peter Groszkowski2

  • 1Centre for Quantum Computer Technology, University of Melbourne, Victoria, Australia
  • 2Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 80, Iss. 5 — November 2009

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×