{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T12:47:34Z","timestamp":1775134054500,"version":"3.50.1"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"name":"ERDF: A way of making Europe","award":["MCIN\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["MCIN\/AEI\/10.13039\/501100011033"]}]},{"name":"European Union NextGeneration EU\/PRTR","award":["PID2022-138906NB-C22 and TED2021-130358B-I00"],"award-info":[{"award-number":["PID2022-138906NB-C22 and TED2021-130358B-I00"]}]},{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"crossref","award":["UJI-B2021-02 and GACUJIMB-2023-03"],"award-info":[{"award-number":["UJI-B2021-02 and GACUJIMB-2023-03"]}],"id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Spanish Ministry of Science, Innovation and Universities","award":["RTI2018-098156-B-C54"],"award-info":[{"award-number":["RTI2018-098156-B-C54"]}]},{"DOI":"10.13039\/501100001870","name":"Foundation for Polish Science","doi-asserted-by":"crossref","award":["Contract 2018\/MAB\/5 and Contract 2018\/MAB\/5\/AS-1"],"award-info":[{"award-number":["Contract 2018\/MAB\/5 and Contract 2018\/MAB\/5\/AS-1"]}],"id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Funds for the Modern Economy Programme"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer\u2013Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.<\/jats:p>","DOI":"10.1145\/3795877","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:51:06Z","timestamp":1770411066000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-2152","authenticated-orcid":false,"given":"Fernando","family":"Hernando","sequence":"first","affiliation":[{"name":"Dept. of Mathematics, Universitat Jaume I","place":["Castell\u00f3 de la Plana, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7912-7826","authenticated-orcid":false,"given":"Gregorio","family":"Quintana-Ort\u00ed","sequence":"additional","affiliation":[{"name":"Depto. de Ingenier\u00eda y Ciencia de Computadores, Universitat Jaume I","place":["Castell\u00f3 de la Plana, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3720-5195","authenticated-orcid":false,"given":"Markus","family":"Grassl","sequence":"additional","affiliation":[{"name":"International Centre for Theory of Quantum Technologies (ICTQT), University of Gda\u0144sk","place":["Gdansk, Poland"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Reinald Baart Tom Boothby Jasper Jasper Cramwinckel Joe Joe Fields Robert Joyner David Miller Eric Minkes Erik Roijackers Lea Ruscio and Cen Tjhai. 2012. GUAVA a GAP package for computing with error-correcting codes Version 3.20. Retrieved February 12 2026 from https:\/\/docs.gap-system.org\/pkg\/guava\/doc\/manual.pdf"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.105772"},{"key":"e_1_3_1_6_2","volume-title":"Stabilizer Codes and Quantum Error Correction","author":"Gottesman Daniel","year":"1997","unstructured":"Daniel Gottesman. 1997. Stabilizer Codes and Quantum Error Correction. Ph. D. Dissertation. California Institute of Technology, Pasadena, California."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1080\/23799927.2020.1850530"},{"key":"e_1_3_1_9_2","unstructured":"The GAP Group. 2015. GAP \u2013 Groups Algorithms and Programming Version 4.7.8. Retrieved February 12 2026 from http:\/\/www.gap-system.org"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302389"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883612"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.92.015003"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.04120"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3573383"},{"key":"e_1_3_1_16_2","unstructured":"Andreas Rossberg. 2019. WebAssembly Core Specification. Retrieved February 12 2026 from https:\/\/www.w3.org\/TR\/wasm-core-1\/"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261958"},{"key":"e_1_3_1_20_2","volume-title":"Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes","author":"Zimmermann Karl-Heinz","year":"1996","unstructured":"Karl-Heinz Zimmermann. 1996. Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes. Technical Report Rep. 3-96. Technische Universit\u00e4t Hamburg-Harburg. Retrieved February 12, 2026 from https:\/\/books.google.es\/books?id=_2FamwEACAAJ"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3795877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:46:19Z","timestamp":1775130379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3795877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,2]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3795877"],"URL":"https:\/\/doi.org\/10.1145\/3795877","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,2]]},"assertion":[{"value":"2024-10-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}