Abstract
We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover, we show that the produced classical LDPC codes are also asymptotically good and locally testable with constant query and soundness parameters, which proves a well-known conjecture in the field of locally testable codes.
Author supplied keywords
Cite
CITATION STYLE
Panteleev, P., & Kalachev, G. (2022). Asymptotically good Quantum and locally testable classical LDPC codes. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 375–388). Association for Computing Machinery. https://doi.org/10.1145/3519935.3520017
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.