{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:11:00Z","timestamp":1787760660145,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451005","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1276-1288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":68,"title":["Fiber bundle codes: breaking the\n            <i>n<\/i>\n            <sup>1\/2<\/sup>\n            polylog(\n            <i>n<\/i>\n            ) barrier for Quantum LDPC codes"],"prefix":"10.1145","author":[{"given":"Matthew B.","family":"Hastings","sequence":"first","affiliation":[{"name":"Station Q, USA \/ Microsoft Quantum, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeongwan","family":"Haah","sequence":"additional","affiliation":[{"name":"Station Q, USA \/ Microsoft Quantum, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryan","family":"O'Donnell","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90189-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050203"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2663199"},{"key":"e_1_3_2_1_4_1","first-page":"3","article-title":"Asymptotically optimal switching circuits","volume":"17","author":"Bassalygo Leonid","year":"1981","unstructured":"Leonid Bassalygo. 1981. Asymptotically optimal switching circuits. Problems of Information Transmission, 17, 3, 1981. Pages 206\u2013211.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM","author":"Bravyi Sergey","unstructured":"Sergey Bravyi and Matthew B. Hastings. 2014. Homological product codes. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM, New York. Pages 273\u2013282."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1979.tb02972.x"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Shai Evra Tali Kaufman and Gilles Z\u00e9mor. 2020. Decodable quantum LDPC codes beyond the \\sqrt n distance barrier using high dimensional expanders.","DOI":"10.1109\/FOCS46700.2020.00029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC14.1-2-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s102080010013"},{"key":"e_1_3_2_1_10_1","volume-title":"Mathematics of quantum computation","author":"Freedman Michael H.","unstructured":"Michael H. Freedman, David A. Meyer, and Feng Luo. 2002. Z_2-systolic freedom and quantum codes. In Mathematics of quantum computation. Chapman & Hall\/CRC, Boca Raton, FL. Pages 287\u2013320."},{"issue":"25","key":"e_1_3_2_1_11_1","first-page":"26","article-title":"Quantum codes from high-dimensional manifolds. In Proceedings of the 8th Annual Innovations in Theoretical Computer Science","author":"Hastings Matthew B.","year":"2017","unstructured":"Matthew B. Hastings. 2017. Quantum codes from high-dimensional manifolds. In Proceedings of the 8th Annual Innovations in Theoretical Computer Science. LIPIcs. Leibniz Int. Proc. Inform.. 67, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern. Pages Art. No. 25, 26.","journal-title":"LIPIcs. Leibniz Int. Proc. Inform.. 67, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern. Pages Art."},{"key":"e_1_3_2_1_12_1","first-page":"15","article-title":"Weight reduction for quantum codes","volume":"17","author":"Hastings Matthew B.","year":"2017","unstructured":"Matthew B. Hastings. 2017. Weight reduction for quantum codes. Quantum Inf. Comput., 17, 15-16, 2017. Pages 1307\u20131334. issn:1533-7146","journal-title":"Quantum Inf. Comput."},{"key":"e_1_3_2_1_13_1","volume-title":"Tessler","author":"Kaufman Tali","year":"2020","unstructured":"Tali Kaufman and Ran J. Tessler. 2020. Quantum LDPC codes with \\Omega (\\sqrt n\\qopname \\relax olog^k n) distance, for any k."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.55"},{"key":"e_1_3_2_1_16_1","unstructured":"Pavel Panteleev and Gleb Kalachev. 2019. Degenerate quantum LDPC codes with good finite length performance."},{"key":"e_1_3_2_1_17_1","unstructured":"Pavel Panteleev and Gleb Kalachev. 2020. Quantum LDPC codes with almost linear minimum distance."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.230504"},{"key":"e_1_3_2_1_19_1","volume-title":"Modern Coding Theory","author":"Richardson Tom","unstructured":"Tom Richardson and R\u00fcdiger Urbanke. 2008. Modern Coding Theory. Cambridge University Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2292061"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Salil P. Vadhan. 2012. Pseudorandomness. Now.","DOI":"10.1561\/9781601985958"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":21,"alternative-id":["10.1145\/3406325.3451005","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451005","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}