• Corpus ID: 243832741

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

  title={Asymptotically Good Quantum and Locally Testable Classical LDPC Codes},
  author={Pavel Panteleev and Gleb Kalachev},
We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover, we show that the produced classical LDPC codes are also asymptotically good and locally testable with constant query and soundness parameters, which proves a well-known conjecture in the field of locally testable codes. 

Figures from this paper

Quantum Tanner codes
This work proves a theorem that simultaneously gives a linearly growing minimum distance for the quantum code and recovers the local testability of the Dinur et al. code.
Fold-Transversal Clifford Gates for Quantum Codes
We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in
Explicit Abelian Lifts and Quantum LDPC Codes
The following explicit constructions of expanders obtained via abelian lifts are shown, including explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes.
Distance bounds for generalized bicycle codes
An exhaustive enumeration of GB codes for certain prime circulant sizes in a family of two-qubit encoding codes with row weights 4, 6, and 8 is done; the observed distance scaling is consistent with A ( w ) n 1 / 2 + B ( w ), where n is the code length and B is increasing with w .
c3-Locally Testable Codes from Lossless Expanders
This work constructs a new LTC family using 1-sided lossless expanders and balanced products and proves that there are c-LTCs which are LTCs with constant rate, constant relative distance and constant locality.
QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
A format for storing matrices associated with q-ary quantum codes is introduced and implemented via the provided import/export functions, based on the well established MaTrix market eXchange (MTX) Coordinate format, and is designed for full backward compatibility with this format.
Locally Testable Codes with constant rate, distance, and locality
This work constructs LTCs with constant rate, constant distance, and constant locality based on a new two-dimensional complex which they call a left-right Cayley complex, which is essentially a graph which has vertices and edges and also has squares.
Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
It is observed that the GKP analog information helps the iterative decoder in escaping harmful trapping sets in the Tanner graph of the QLDPC code, thereby eliminating or significantly lowering the error floor of the logical error rate curves.
Partitioning qubits in hypergraph product codes to implement logical gates
It is demonstrated that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring
This work constructs asymptotically-good RLDC and RLCC with an improved query complexity of p log n q O p log log log nq and devise a mechanism– an alternative to the tensor product–that squares the length of a given code.


Homological product codes
This work proposes the first family of good quantum codes with low-weight stabilizers, and conjecture that similar methods can produce good stabilizer codes with stabilizer weight O(nα) for any α > 0.
Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates.
We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product codes by Tillich and Zémor and all families of toric codes on m-dimensional hypercubic
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
This paper considers quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over the finite fields GF(3) and GF(5).
Quantum Expander Codes
We present an efficient decoding algorithm for constant rate quantum hyper graph-product LDPC codes which provably corrects adversarial errors of weight proportional to the code minimum distance, or
Quantum Low-Density Parity-Check Codes
Quantum LDPC codes with positive rate and minimum distance proportional to n½
This work builds quantum LDPC codes with fixed non-zero rate and proves that their minimum distance grows proportionally to the square root of the blocklength.
Locally testable codes and PCPs of almost-linear length
The novel techniques in use include a random projection of certain codewords and PCP-oracles that preserves local-testability, an adaptation of PCP constructions to obtain “linear PCP” for proving conjunctions of linear conditions, and design of PCPs with some new soundness properties.
On quasi-twisted codes over finite fields
  • Yan Jia
  • Computer Science
    Finite Fields Their Appl.
  • 2012
Quantum Quasi-Cyclic LDPC Codes
  • M. Hagiwara, H. Imai
  • Computer Science
    2007 IEEE International Symposium on Information Theory
  • 2007
A construction of a pair of quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed based on algebraic combinatorics and have lots of variations for length, code rate.
Constructions of quasi-twisted quantum codes
This work utilizes self-orthogonal QT codes to provide quantum codes via the famous Hermitian construction, and presents a new construction method of q -ary quantum codes, which can be viewed as an effective generalization of the HerMITian construction.