Asymptotically good Quantum and locally testable classical LDPC codes

194Citations
Citations of this article
66Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free