• Rapid Communication

Fault tolerance of quantum low-density parity check codes with sublinear distance scaling

Alexey A. Kovalev and Leonid P. Pryadko
Phys. Rev. A 87, 020304(R) – Published 28 February 2013

Abstract

We study the fault tolerance of quantum low-density parity check (LDPC) codes, such as generalized toric codes with a finite rate suggested by Tillich and Zémor [in ISIT 2009: IEEE International Symposium on Information Theory (IEEE, New York, 2009)]. We show that any family of quantum LDPC codes where each syndrome measurement involves a limited number of qubits and each qubit is involved in a limited number of measurements (as well as any similarly limited family of classical LDPC codes), in which distance scales as a positive power α of the number of physical qubits (α<1 for “bad” codes), has a finite error probability threshold. We conclude that for sufficiently large quantum computers, quantum LDPC codes can offer an advantage over the toric codes.

  • Figure
  • Received 18 August 2012

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

©2013 American Physical Society

Authors & Affiliations

Alexey A. Kovalev and Leonid P. Pryadko

  • Department of Physics and Astronomy, University of California, Riverside, California 92521, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 87, Iss. 2 — February 2013

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
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
×