{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:55:30Z","timestamp":1778338530863,"version":"3.51.4"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:00:00Z","timestamp":1708732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Energy Research Scientific Computing Center (NERSC), a U.S. Department of Energy Office of Science User Facility located at Lawrence Berkeley National Laboratory","award":["DE-AC02-05CH11231 using NERSC Award No. ERCAP0022238"],"award-info":[{"award-number":["DE-AC02-05CH11231 using NERSC Award No. ERCAP0022238"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching\u2013 (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML-based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold for various noise models. We show that the proposed ML-based decoding method achieves ~ 5 \u00d7 higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search-based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors and thus a further improvement of ~ 14% in the threshold over the basic ML decoder. Last, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search.<\/jats:p>","DOI":"10.1145\/3636516","type":"journal-article","created":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T06:07:53Z","timestamp":1702706873000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1795-5298","authenticated-orcid":false,"given":"Debasmita","family":"Bhoumik","sequence":"first","affiliation":[{"name":"Advanced Computing &amp; Microelectronics Unit, Indian Statistical Institute, Baranagar, West Bengal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0730-0084","authenticated-orcid":false,"given":"Ritajit","family":"Majumdar","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM India Research Lab, Thanisandra, Bengaluru, Karnataka"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0629-0018","authenticated-orcid":false,"given":"Dhiraj","family":"Madan","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM India Research Lab, Thanisandra, Bengaluru, Karnataka"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9388-7154","authenticated-orcid":false,"given":"Dhinakaran","family":"Vinayagamurthy","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM India Research Lab, Thanisandra, Bengaluru, Karnataka"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2323-8938","authenticated-orcid":false,"given":"Shesha","family":"Raghunathan","sequence":"additional","affiliation":[{"name":"IBM Quantum, IBM India Research Lab, Thanisandra, Bengaluru, Karnataka"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-3779","authenticated-orcid":false,"given":"Susmita","family":"Sur-Kolay","sequence":"additional","affiliation":[{"name":"Advanced Computing &amp; Microelectronics Unit, Indian Statistical Institute, Baranagar, West Bengal"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,24]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2015.0301"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.77.793"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.77.198"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.180501"},{"issue":"6","key":"e_1_3_3_10_2","article-title":"Machine-learning based decoding of surface code syndromes in quantum error correction","volume":"1","author":"Bhoumik D.","year":"2022","unstructured":"D. Bhoumik, P. Sen, R. Majumdar, S. Sur-Kolay, K. J. Latesh K., and S. S. Iyengar. 2022. Machine-learning based decoding of surface code syndromes in quantum error correction. J. Eng. Res. Sci. 1, 6 (2022).","journal-title":"J. Eng. Res. Sci."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.1499754"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.052312"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.83.020302"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.160503"},{"key":"e_1_3_3_15_2","unstructured":"S. B. Bravyi and A. Yu Kitaev. 1998. Quantum codes on a lattice with boundary. arXiv preprint quant-ph\/9811052."},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.011022"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.73.012340"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"e_1_3_3_20_2","article-title":"An interpretation of union-find decoder on weighted graphs","author":"Wu Yue","year":"2022","unstructured":"Yue Wu, Namitha Liyanage, and Lin Zhong. 2022. An interpretation of union-find decoder on weighted graphs. arXiv:2211.03288. Retrieved from https:\/\/arxiv.org\/abs\/2211.03288","journal-title":"arXiv:2211.03288"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-12-02-595"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa955a"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"M. A. Nielsen and I. Chuang. 2002. Quantum Computation and Quantum Information. Cambridge university press.","DOI":"10.1119\/1.1463744"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.030501"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1049\/qtc2.12042"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","unstructured":"C. Chamberland and P. Ronagh. 2018. Deep neural decoders for near term fault-tolerant experiments. Quantum Science and Technology 3 4 (2018) 044002.","DOI":"10.1088\/2058-9565\/aad1f7"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-11266-1"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","unstructured":"R. Sweke M. S. Kesselring et\u00a0al. 2018. Reinforcement learning decoders for fault-tolerant quantum computation. Machine Learning: Science and Technology 2 2 (2018) 025005.","DOI":"10.1088\/2632-2153\/abc609"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2948612"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3505637"},{"issue":"2","key":"e_1_3_3_31_2","first-page":"021041","article-title":"2d compass codes","volume":"9","author":"Li Muyuan","year":"2019","unstructured":"Muyuan Li, Daniel Miller, Michael Newman, Yukai Wu, and Kenneth R. Brown. 2019. 2d compass codes. Phys. Rev. X 9, 2 (2019), 021041.","journal-title":"Phys. Rev. X"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-01-29-48"},{"key":"e_1_3_3_33_2","volume-title":"Linear Algebra and its Applications.","author":"Strang G.","year":"2006","unstructured":"G. Strang. 2006. Linear Algebra and its Applications.Belmont, CA: Thomson, Brooks\/Cole."},{"key":"e_1_3_3_34_2","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2022","unstructured":"T. H. Cormen, C. E. Leiserson, R. L Rivest, and C. Stein. 2022. Introduction to Algorithms. MIT Press."},{"key":"e_1_3_3_35_2","unstructured":"[n.d.]. Plaquette\u2014An All-encompassing Fault-tolerance Software Package. Retrieved from https:\/\/docs.plaquette.design\/en\/latest\/"},{"key":"e_1_3_3_36_2","unstructured":"Ethem Alpaydin. Machine Learning. Mit Press."},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2948612"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636516","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3636516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:11Z","timestamp":1750287251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,24]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3636516"],"URL":"https:\/\/doi.org\/10.1145\/3636516","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,24]]},"assertion":[{"value":"2022-10-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-25","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}