Quantum Kronecker sum-product low-density parity-check codes with finite rate

Alexey A. Kovalev and Leonid P. Pryadko
Phys. Rev. A 88, 012311 – Published 11 July 2013

Abstract

We introduce an ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Zémor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many thus defined codes have a finite rate and limited-weight stabilizer generators, an analog of classical low-density parity-check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have a wider range of parameters; in particular, they can have a higher rate while preserving the estimated error threshold.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 2 January 2013

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

©2013 American Physical Society

Authors & Affiliations

Alexey A. Kovalev and Leonid P. Pryadko

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

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 88, Iss. 1 — July 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
×