{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:09:16Z","timestamp":1764688156509,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"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":[[2025,5,26]]},"DOI":"10.1145\/3728179.3728184","type":"proceedings-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T14:09:58Z","timestamp":1747318198000},"page":"126-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Systolic array based syndrome graph pruning for quantum error correction using FPGAs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9855-5527","authenticated-orcid":false,"given":"Prasoon","family":"Ambalathankandy","sequence":"first","affiliation":[{"name":"RIKEN Center for Computational Science, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2951-3059","authenticated-orcid":false,"given":"Werner","family":"Florian Samayoa","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7544-7925","authenticated-orcid":false,"given":"Jan","family":"Erik R. Wichmann","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6681-4192","authenticated-orcid":false,"given":"Kentaro","family":"Sano","sequence":"additional","affiliation":[{"name":"RIKEN Center for Computational Science, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Altera. 2024. Second Generation Hyperflex\u00ae Core Architecture \u2014 intel.com. https:\/\/www.intel.com\/content\/www\/us\/en\/docs\/programmable\/683458\/current\/second-generation-core-architecture.html. [Accessed 20-02-2025]."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Bela Bauer Sergey Bravyi Mario Motta and Garnet Kin-Lic Chan. 2020. Quantum algorithms for quantum chemistry and quantum materials science. Chemical Reviews 120 22 (2020) 12685\u201312717.","DOI":"10.1021\/acs.chemrev.9b00829"},{"key":"e_1_3_3_1_4_2","unstructured":"Maciej Besta Dimitri Stanojevic Johannes De\u00a0Fine Licht Tal Ben-Nun and Torsten Hoefler. 2019. Graph processing on fpgas: Taxonomy survey challenges. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1903.06697 (2019)."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"H. Bombin and M.\u00a0A. Martin-Delgado. 2007. Optimal resources for topological two-dimensional stabilizer codes: Comparative study. Physical Review A 76 1 (July 2007) 012305. https:\/\/doi.org\/10.1103\/physreva.76.012305","DOI":"10.1103\/PhysRevA.76.012305"},{"key":"e_1_3_3_1_6_2","unstructured":"Alexander Cowtan. 2024. SSIP: automated surgery with quantum LDPC codes. (July 2024). https:\/\/doi.org\/10.48550\/ARXIV.2407.09423 arxiv:https:\/\/arXiv.org\/abs\/2407.09423\u00a0[quant-ph]"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021739"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507707"},{"key":"e_1_3_3_1_9_2","unstructured":"Poulami Das Christopher\u00a0A Pattison Srilatha Manne Douglas Carmean Krysta Svore Moinuddin Qureshi and Nicolas Delfosse. 2020. A scalable decoder micro-architecture for fault-tolerant quantum computing. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2001.06598 (2020)."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Nicolas Delfosse and Naomi\u00a0H Nickerson. 2021. Almost-linear time decoding algorithm for topological codes. Quantum 5 (2021) 595.","DOI":"10.22331\/q-2021-12-02-595"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Eric Dennis Alexei Kitaev Andrew Landahl and John Preskill. 2002. Topological quantum memory. J. Math. Phys. 43 9 (2002) 4452\u20134505.","DOI":"10.1063\/1.1499754"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Oscar Higgott Thomas\u00a0C. Bohdanowicz Aleksander Kubica Steven\u00a0T. Flammia and Earl\u00a0T. Campbell. 2023. Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes. Physical Review X 13 3 (July 2023) 031007. https:\/\/doi.org\/10.1103\/physrevx.13.031007","DOI":"10.1103\/PhysRevX.13.031007"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"A\u00a0Yu Kitaev. 1997. Quantum computations: algorithms and error correction. Russian Mathematical Surveys 52 6 (Dec. 1997) 1191\u20131249. https:\/\/doi.org\/10.1070\/rm1997v052n06abeh002155","DOI":"10.1070\/RM1997v052n06ABEH002155"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00106"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Namitha Liyanage Yue Wu Siona Tagare and Lin Zhong. 2024. FPGA-based distributed union-find decoder for surface codes. IEEE Transactions on Quantum Engineering (2024).","DOI":"10.36227\/techrxiv.171624125.57457222\/v1"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Patrick Rebentrost and Seth Lloyd. 2024. Quantum computational finance: quantum algorithm for portfolio optimization. KI-K\u00fcnstliche Intelligenz (2024) 1\u201312.","DOI":"10.1007\/s13218-024-00870-9"},{"key":"e_1_3_3_1_17_2","unstructured":"Manuel Rispler Davide Vodola Markus M\u00fcller and Seyong Kim. 2024. The random coupled-plaquette gauge model and the surface code under circuit-level noise. (Dec. 2024). https:\/\/doi.org\/10.48550\/ARXIV.2412.14004 arxiv:https:\/\/arXiv.org\/abs\/2412.14004\u00a0[quant-ph]"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293900"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Peter\u00a0W. Shor. 1995. Scheme for reducing decoherence in quantum computer memory. Physical Review A 52 4 (Oct. 1995) R2493\u2013R2496. https:\/\/doi.org\/10.1103\/physreva.52.r2493","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Peter\u00a0W. Shor. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26 5 (Oct. 1997) 1484\u20131509. https:\/\/doi.org\/10.1137\/s0097539795293172","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Luka Skoric Dan\u00a0E Browne Kenton\u00a0M Barnes Neil\u00a0I Gillespie and Earl\u00a0T Campbell. 2023. Parallel window decoding enables scalable fault tolerant quantum computation. Nature Communications 14 1 (2023) 7040.","DOI":"10.1038\/s41467-023-42482-1"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00163"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Barbara\u00a0M. Terhal. 2015. Quantum error correction for quantum memories. Reviews of Modern Physics 87 2 (April 2015) 307\u2013346. https:\/\/doi.org\/10.1103\/revmodphys.87.307","DOI":"10.1103\/RevModPhys.87.307"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Lieven M.\u00a0K. Vandersypen Matthias Steffen Gregory Breyta Costantino\u00a0S. Yannoni Mark\u00a0H. Sherwood and Isaac\u00a0L. Chuang. 2001. Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature 414 6866 (Dec. 2001) 883\u2013887. https:\/\/doi.org\/10.1038\/414883a","DOI":"10.1038\/414883a"}],"event":{"name":"HEART 2025: 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","acronym":"HEART 2025","location":"Kumamoto Japan"},"container-title":["Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728179.3728184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:06Z","timestamp":1750295946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":23,"alternative-id":["10.1145\/3728179.3728184","10.1145\/3728179"],"URL":"https:\/\/doi.org\/10.1145\/3728179.3728184","relation":{},"subject":[],"published":{"date-parts":[[2025,5,25]]},"assertion":[{"value":"2025-05-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}