Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
Information Theory
2015-03-05 v2 math.IT
Quantum Physics
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 propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.
Keywords
Cite
@article{arxiv.0903.0566,
title = {Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}},
author = {Jean-Pierre Tillich and Gilles Zemor},
journal= {arXiv preprint arXiv:0903.0566},
year = {2015}
}
Comments
21 pages