Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates

Tomas Jochym-O’Connor and Raymond Laflamme
Phys. Rev. Lett. 112, 010505 – Published 10 January 2014

Abstract

We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure universal fault tolerance and discuss a particular example using the 7-qubit Steane and 15-qubit Reed-Muller codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria, our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. We believe that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.

  • Figure
  • Figure
  • Received 20 September 2013

DOI:https://doi.org/10.1103/PhysRevLett.112.010505

© 2014 American Physical Society

Authors & Affiliations

Tomas Jochym-O’Connor1,2,* and Raymond Laflamme1,2,3

  • 1Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
  • 2Department of Physics and Astronomy, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
  • 3Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, Ontario N2L 2Y5, Canada

  • *trjochym@uwaterloo.ca

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 112, Iss. 1 — 10 January 2014

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 Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×