{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T18:21:55Z","timestamp":1774030915323,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101001318"],"award-info":[{"award-number":["101001318"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567934","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"709-714","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Software Tools for Decoding Quantum Low-Density Parity-Check Codes"],"prefix":"10.1145","author":[{"given":"Lucas","family":"Berent","sequence":"first","affiliation":[{"name":"Technical University of Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Burgholzer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Germany and Hagenberg GmbH, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3097347"},{"key":"e_1_3_2_1_3_1","first-page":"375","article-title":"Asymptotically good quantum and locally testable classical LDPC codes","author":"Panteleev P.","year":"2022","unstructured":"P. Panteleev and G. Kalachev, \"Asymptotically good quantum and locally testable classical LDPC codes,\" in Symp. on Theory of Computing, 2022, pp. 375--388.","journal-title":"Symp. on Theory of Computing"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"e_1_3_2_1_5_1","volume-title":"Good quantum LDPC codes with linear time decoders","author":"Dinur I.","year":"2022","unstructured":"I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, Good quantum LDPC codes with linear time decoders, 2022. arXiv: 2206.07750."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-11-22-585"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143452"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.4741"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.040353"},{"issue":"4","key":"e_1_3_2_1_11_1","first-page":"423","article-title":"Decoding across the quantum low-density parity-check code landscape","volume":"2","author":"Roffe J.","year":"2020","unstructured":"J. Roffe, D. R. White, S. Burton, and E. Campbell, \"Decoding across the quantum low-density parity-check code landscape,\" Physical Review R, vol. 2, no. 4, p. 043 423, 2020.","journal-title":"Physical Review R"},{"key":"e_1_3_2_1_12_1","volume-title":"LDPC: Python tools for low density parity check codes","author":"Roffe J.","year":"2022","unstructured":"J. Roffe, LDPC: Python tools for low density parity check codes, 2022. [Online]. Available: https:\/\/pypi.org\/project\/ldpc\/."},{"key":"e_1_3_2_1_13_1","volume-title":"Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching","author":"Higgott O.","year":"2021","unstructured":"O. Higgott, Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching, 2021. arXiv: 2105.13082."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-07-06-497"},{"key":"e_1_3_2_1_15_1","volume-title":"Improved single-shot decoding of higher dimensional hypergraph product codes","author":"Higgott O.","year":"2022","unstructured":"O. Higgott and N. P. Breuckmann, Improved single-shot decoding of higher dimensional hypergraph product codes, 2022. arXiv: 2206.03122."},{"key":"e_1_3_2_1_16_1","volume-title":"On the iterative decoding of sparse quantum codes,\" qic","author":"Poulin D.","unstructured":"D. Poulin and Y. Chung, \"On the iterative decoding of sparse quantum codes,\" qic, vol. 8, no. 10, pp. 987--1000, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-12-02-595"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4891487"},{"key":"e_1_3_2_1_19_1","volume-title":"Golden codes: Quantum {LDPC} codes built from regular tessellations of hyperbolic 4-manifolds","author":"Londe V.","year":"2017","unstructured":"V. Londe and A. Leverrier, Golden codes: Quantum {LDPC} codes built from regular tessellations of hyperbolic 4-manifolds, 2017. arXiv: 1712.08578."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-02-24-661"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685164.2685173"},{"key":"e_1_3_2_1_23_1","first-page":"810","article-title":"Quantum expander codes","author":"Leverrier A.","year":"2015","unstructured":"A. Leverrier, J.-P. Tillich, and G. Z\u00e9mor, \"Quantum expander codes,\" in Foundations of Computer Science, 2015, pp. 810--824.","journal-title":"Foundations of Computer Science"},{"key":"e_1_3_2_1_24_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Third Edition, 3rd. The MIT Press, 2009."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan \"Efficiency of a good but not linear set union algorithm \" jacm vol. 22 no. 2 pp. 215--225 1975.","DOI":"10.1145\/321879.321884"}],"event":{"name":"ASPDAC '23: 28th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEICE","IEEE CAS","IPSJ"]},"container-title":["Proceedings of the 28th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567934","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T17:36:13Z","timestamp":1767807373000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":25,"alternative-id":["10.1145\/3566097.3567934","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567934","relation":{},"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"2023-01-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}