Asymptotically good Quantum and locally testable classical LDPC codes

DOI10.1145/3519935.3520017arXiv2111.03654OpenAlexW3213933684MaRDI QIDQ6083491

G. V. Kalachev, Pavel A. Panteleev

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03654

zbMATH Keywords

LDPC codesexpander graphsquantum codeslocally testable codeschain complexes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

A construction of combinatorial NLTS ⋮ Single-shot decoding of good quantum LDPC codes ⋮ Homological quantum rotor codes: logical qubits from torsion

This page was built for publication: Asymptotically good Quantum and locally testable classical LDPC codes