{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:07:21Z","timestamp":1766732841812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":85,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649680","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1507-1516","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Approaching the Quantum Singleton Bound with Approximate Error Correction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5579-8090","authenticated-orcid":false,"given":"Thiago","family":"Bergamaschi","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5169-0596","authenticated-orcid":false,"given":"Louis","family":"Golowich","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6173-4046","authenticated-orcid":false,"given":"Sam","family":"Gunn","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799359385"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS \u201995)","author":"Alon N.","year":"1867","unstructured":"N. Alon, J. Edmonds, and M. Luby. 1995. Linear Time Erasure Codes with Nearly Optimal Recovery. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS \u201995). IEEE Computer Society, USA. 512. isbn:0818671831"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862089"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.959288"},{"key":"e_1_3_2_1_5_1","unstructured":"Koenraad MR Audenaert. 2006. A sharp Fannes-type inequality for the von Neumann entropy."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181969"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1459754"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850671"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10698-9_7"},{"key":"e_1_3_2_1_10_1","volume-title":"General conditions for approximate quantum error correction and near-optimal recovery channels. Physical review letters, 104, 12","author":"B\u00e9ny C\u00e9dric","year":"2010","unstructured":"C\u00e9dric B\u00e9ny and Ognyan Oreshkov. 2010. General conditions for approximate quantum error correction and near-optimal recovery channels. Physical review letters, 104, 12 (2010), 120501."},{"key":"e_1_3_2_1_11_1","unstructured":"Thiago Bergamaschi. 2023. Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels. arxiv:2304.06269."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1131563"},{"key":"e_1_3_2_1_13_1","volume-title":"Atomic, molecular, and optical physics, 54 2","author":"Shor Calderbank","year":"1996","unstructured":"Calderbank and Shor. 1996. Good quantum error-correcting codes exist.. Physical review. A, Atomic, molecular, and optical physics, 54 2 (1996), 1098\u20131105."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.648"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_30"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839515"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-005-1317-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314468"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585101"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"e_1_3_2_1_25_1","unstructured":"Peter Elias. 1957. List decoding for noisy channels."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.8374"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.135"},{"key":"e_1_3_2_1_28_1","unstructured":"Daniel Gottesman. 1997. Stabilizer Codes and Quantum Error Correction."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.L020601"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3149291"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585169"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3131992"},{"key":"e_1_3_2_1_33_1","unstructured":"Venkatesan Guruswami. 2001. List decoding of error correcting codes."},{"key":"e_1_3_2_1_34_1","first-page":"49","volume-title":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","author":"Guruswami Venkatesan","year":"2003","unstructured":"Venkatesan Guruswami. 2003. List decoding from erasures: bounds and code constructions. 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 49 (2003), 2826\u20132833."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214429"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.2140\/ant.2010.4.433"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959942"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510023"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_59"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.134"},{"key":"e_1_3_2_1_45_1","first-page":"1","article-title":"Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes","volume":"69","author":"Guruswami Venkatesan","year":"2020","unstructured":"Venkatesan Guruswami and Chaoping Xing. 2020. Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. ACM Journal of the ACM (JACM), 69 (2020), 1 \u2013 48.","journal-title":"ACM Journal of the ACM (JACM)"},{"key":"e_1_3_2_1_46_1","unstructured":"Venkatesan Guruswami Chaoping Xing and Chen Yuan. 2017. Subspace Designs based on Algebraic Function Fields. arxiv:1704.05992"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-020-03689-1"},{"key":"e_1_3_2_1_48_1","article-title":"Local list recovery of high-rate tensor codes and applications","volume":"49","author":"Hemenway Brett","year":"2019","unstructured":"Brett Hemenway, Noga Ron-Zewi, and Mary Wootters. 2019. Local list recovery of high-rate tensor codes and applications. SIAM J. Comput., 49, 4 (2019), FOCS17\u2013157.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.02.004"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2053903"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2299800"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883612"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.038"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Emanuel Knill and Raymond Laflamme. 1996. Concatenated Quantum Codes.","DOI":"10.2172\/369608"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Emanuel Knill and Raymond Laflamme. 1997. Theory of quantum error-correcting codes. 900-911 pages.","DOI":"10.1103\/PhysRevA.55.900"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897523"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023962"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/20m1370215"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917696"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.012320"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246274"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913433"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.2567"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","unstructured":"Anthony Leverrier and Gilles Z\u00e9mor. 2022. A parallel decoder for good quantum LDPC codes. https:\/\/doi.org\/10.48550\/ARXIV.2208.05537 arXiv:2208.05537. 10.48550\/ARXIV.2208.05537","DOI":"10.48550\/ARXIV.2208.05537"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH45"},{"key":"e_1_3_2_1_68_1","unstructured":"Zhuo Li Li-Juan Xing and Xinmei Wang. 2008. Quantum generalized Reed-Solomon codes: Unified framework for quantum MDS codes. arXiv:0812.4514. arxiv:0812.4514"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3277808"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.012335"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.81.062342"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520017"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796376"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782103"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055816"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Noga Ron-Zewi Mary Wootters and Gilles Z\u00e9mor. 2020. Linear-time Erasure List-decoding of Expander Codes. arxiv:2002.08579","DOI":"10.1109\/ISIT44484.2020.9174325"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365393"},{"key":"e_1_3_2_1_78_1","unstructured":"Atri Rudra. 2007. List Decoding and Property Testing of Error Correcting Codes."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1023\/A"},{"volume-title":"Atomic, molecular, and optical physics, 54 6","year":"1996","key":"e_1_3_2_1_80_1","unstructured":"Steane. 1996. Simple quantum error-correcting codes.. Physical review. A, Atomic, molecular, and optical physics, 54 6 (1996), 4741\u20134751."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"crossref","unstructured":"Madhu Sudan. 2000. List decoding: algorithms and applications.","DOI":"10.1007\/3-540-44929-9_3"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.58.1827"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2292052"},{"key":"e_1_3_2_1_84_1","unstructured":"J. M. Wozencraft.. 1958. List Decoding.. 48:90\u201395 pages."},{"key":"e_1_3_2_1_85_1","volume-title":"Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007)","volume":"162","author":"Yamakami Tomoyuki","year":"2007","unstructured":"Tomoyuki Yamakami. 2007. Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. In Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Proceedings, Joachim Gudmundsson and C. Barry Jay (Eds.) (CRPIT, Vol. 65). Australian Computer Society, Ballarat, Victoria, Australia. 153\u2013162. http:\/\/crpit.scem.westernsydney.edu.au\/abstracts\/CRPITV65Yamakami.html"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":85,"alternative-id":["10.1145\/3618260.3649680","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649680","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}