Distance Verification for Classical and Quantum LDPC Codes

Authors

Ilya Dumer, University of California at RiversideFollow
Alexey Kovalev, University of Nebraska - LncolnFollow
Leonid P. Pryadko, University of California - RiversideFollow

Date of this Version

7-2017

Citation

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 63, NO. 7, JULY 2017

Abstract

The techniques of distance verification known for general linear codes are first applied to the quantum stabilizer codes. Then, these techniques are considered for classical and quantum (stabilizer) low-density-parity-check (LDPC) codes. New complexity bounds for distance verification with provable performance are derived using the average weight spectra of the ensembles of LDPC codes. These bounds are expressed in terms of the erasure-correcting capacity of the corresponding ensemble. We also present a new irreducible-cluster technique that can be applied to any LDPC code and takes advantage of parity-checks’ sparsity for both the classical and quantum LDPC codes. This technique reduces complexity exponents of all existing deterministic techniques designed for generic stabilizer codes with small relative distances, which also include all known families of the quantum stabilizer LDPC codes.