Quantum LDPC codes with positive rate and minimum distance proportional to n½
Jean–Pierre Tillich, Gilles Zémor · 2009
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the block length. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the block length.