@inproceedings{f00da7e4b8b44bd88ebae93b9a984398,
title = "Good Quantum LDPC Codes with Linear Time Decoders",
abstract = "We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2m× m)V →-0 (2m)E →-1 2F where V (X-checks) are the vertices, E (qubits) are the edges, and F (Z-checks) are the squares of a left-right Cayley complex, and where the maps are defined based on a pair of constant-size random codes CA,CB:2m→2-{"}where Δis the regularity of the underlying Cayley graphs. One of the main ingredients in the analysis is a proof of an essentially-optimal robustness property for the tensor product of two random codes.",
author = "Irit Dinur and Hsieh, \{Min Hsiu\} and Lin, \{Ting Chun\} and Thomas Vidick",
note = "Publisher Copyright: {\textcopyright} 2023 Owner/Author.; 55th Annual ACM Symposium on Theory of Computing, STOC 2023 ; Conference date: 20-06-2023 Through 23-06-2023",
year = "2023",
month = jun,
day = "2",
doi = "10.1145/3564246.3585101",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "905--918",
editor = "Barna Saha and Servedio, \{Rocco A.\}",
booktitle = "STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing",
}