Physics Commons^™

Distance Verification For Classical And Quantum Ldpc Codes, Ilya Dumer, Alexey Kovalev, Leonid P. Pryadko

Department of Physics and Astronomy: Faculty Publications

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 …