Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Tillich et al. (2009) studied this question.