Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

@article{Tillich2009QuantumLC,
  title={Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength},
  author={Jean-Pierre Tillich and Gilles Z{\'e}mor},
  journal={2009 IEEE International Symposium on Information Theory},
  year={2009},
  pages={799-803}
}
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with a 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. 

From This Paper

Figures, tables, and topics from this paper.
17 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Quantum quasi-cyclic lowdensity parity check codes, March 2008. arXiv:0803.0100v1 [quant-ph

  • M-H. Hsieh, T. A. Brun, I. Devetak
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…