Â鶹´«Ã½AV

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Pavel Panteleev Gleb Kalachev
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC2022), Rome, Italy, June 2022
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.