Key points are not available for this paper at this time.
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.
Tillich et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: