Quantum LDPC codes with positive rate and minimum distance proportional to n 1/2

Authors:
Jean-Pierre Tillich;Gilles Zémor
Affiliations:
INRIA, Le Chesnay, France;Institut de Mathématiques de Bordeaux, Université Bordeaux 1, Talence Cedex, France
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 5
Cited 2

Mathematics of Quantum Computation

Mathematics of Quantum Computation
On the iterative decoding of sparse quantum codes

Quantum Information & Computation
Expander codes

IEEE Transactions on Information Theory - Part 1
On expander codes

IEEE Transactions on Information Theory
Sparse-graph codes for quantum error correction

IEEE Transactions on Information Theory

Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel

Quantum Information & Computation
Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the blocklength.