Distance verification for classical and quantum LDPC codes
arXiv:1611.07164
Abstract
The techniques of distance verification known for general linear codes are re-applied to quantum stabilizer codes. Then distance verification is addressed for classical and quantum 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 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 quantum LDPC codes.
arXiv comment16 pages, 2 figures
References in corpus (12)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Good Quantum Error-Correcting Codes Exist
- Fault-tolerant quantum computation with high threshold in two dimensions
- Sparse Graph Codes for Quantum Error-Correction
- Tradeoffs for reliable quantum information storage in 2D systems
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
- Homological Product Codes
- New constructions of CSS codes obtained by moving to higher alphabets
- A Construction of Quantum LDPC Codes from Cayley Graphs