{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T12:34:55Z","timestamp":1776947695866,"version":"3.51.4"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","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>It is widely recognized that quantum computing has profound impacts on multiple fields, including but not limited to cryptography, machine learning, materials science, and so on. To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels and to design efficient fault-tolerant quantum computing (FTQC) schemes. Currently, various FTQC schemes have been developed for different hardware platforms. However, a comprehensive framework for the analysis and evaluation of these schemes is still lacking. In this work, we propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes on quantum hardware platforms. This benchmarking framework will integrate essential relevant factors, e.g., the code rates of quantum error-correcting codes, the accuracy, throughput, and latency of the decoder. Through a resource analysis of factoring RSA-2048, we demonstrate that QLOPS reflects the practical requirements of quantum algorithm execution. This framework will enable the identification of bottlenecks in quantum hardware, providing potential directions for their development. Moreover, our results will help establish a comparative framework for evaluating FTQC designs. As this benchmarking approach considers practical applications, it may assist in estimating the hardware resources needed to implement quantum algorithms and offers preliminary insights into potential timelines.<\/jats:p>","DOI":"10.1145\/3797968","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:56:39Z","timestamp":1773348999000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Benchmarking fault-tolerant quantum computing hardware via QLOPS"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5854-5340","authenticated-orcid":false,"given":"Linghang","family":"Kong","sequence":"first","affiliation":[{"name":"Zhongguancun Laboratory","place":["Beijing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0000-7101","authenticated-orcid":false,"given":"Fang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhongguancun Laboratory","place":["Beijing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9365-776X","authenticated-orcid":false,"given":"Jianxin","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University","place":["Beijing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Rajeev Acharya Laleh Aghababaie-Beni Igor Aleiner Trond I. Andersen Markus Ansmann Frank Arute Kunal Arya Abraham Asfaw Nikita Astrakhantsev Juan Atalaya et\u00a0al. 2024. Quantum error correction below the surface code threshold. Nature 638 8052 (2024) 920. DOI:10.1038\/s41586-024-08449-y","DOI":"10.1038\/s41586-024-08449-y"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Robin Blume-Kohout and Kevin C. Young. 2020. A volumetric framework for quantum computer benchmarks. Quantum 4 (Nov.2020) 362. DOI:10.22331\/q-2020-11-15-362","DOI":"10.22331\/q-2020-11-15-362"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Dolev Bluvstein Simon J. Evered Alexandra A. Geim Sophie H. Li Hengyun Zhou Tom Manovitz Sepehr Ebadi Madelyn Cain Marcin Kalinowski Dominik Hangleiter et\u00a0al. 2024. Logical quantum processor based on reconfigurable atom arrays. Nature 626 7997 (2024) 58\u201365. DOI:10.1038\/s41586-023-06927-3","DOI":"10.1038\/s41586-023-06927-3"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Colin D. Bruzewicz John Chiaverini Robert McConnell and Jeremy M. Sage. 2019. Trapped-ion quantum computing: Progress and challenges. Applied Physics Reviews 6 2 (052019) 021314. DOI:10.1063\/1.5088164","DOI":"10.1063\/1.5088164"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2505.13587"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Madelyn Cain Chen Zhao Hengyun Zhou Nadine Meister J. Pablo Bonilla Ataides Arthur Jaffe Dolev Bluvstein and Mikhail D. Lukin. 2024. Correlated decoding of logical algorithms with transversal gates. Physical Review Letters 133 24 (2024) 240602. DOI:10.1103\/PhysRevLett.133.240602","DOI":"10.1103\/PhysRevLett.133.240602"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Andrew M. Childs Dmitri Maslov Yunseong Nam Neil J. Ross and Yuan Su. 2018. Toward the first quantum simulation with quantum speedup. Proceedings of the National Academy of Sciences 115 38 (2018) 9456\u20139461. DOI:10.1073\/pnas.1801723115","DOI":"10.1073\/pnas.1801723115"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Lawrence Z. Cohen Isaac H. Kim Stephen D. Bartlett and Benjamin J. Brown. 2022. Low-overhead fault-tolerant quantum computing using long-range connectivity. Science Advances 8 20 (2022) eabn1717. DOI:10.1126\/sciadv.abn1717","DOI":"10.1126\/sciadv.abn1717"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2503.05003"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Andrew W. Cross Lev S. Bishop Sarah Sheldon Paul D. Nation and Jay M. Gambetta. 2019. Validating quantum computers using randomized model circuits. Physical Review A 100 3 (Sep2019) 032328. DOI:10.1103\/PhysRevA.100.032328","DOI":"10.1103\/PhysRevA.100.032328"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Antonio D. C\u00f3rcoles Abhinav Kandala Ali Javadi-Abhari Douglas T. McClure Andrew W. Cross Kristan Temme Paul D. Nation Matthias Steffen and Jay M. Gambetta. 2020. Challenges and opportunities of near-term quantum computing systems. Proceedings of the IEEE 108 8 (2020) 1338\u20131352. DOI:10.1109\/JPROC.2019.2954005","DOI":"10.1109\/JPROC.2019.2954005"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2505.15917"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1905.08916"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2409.17595"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Aram W. Harrow Avinatan Hassidim and Seth Lloyd. 2009. Quantum algorithm for linear systems of equations. Physical Review Letters 103 15 (Oct2009) 150502. DOI:10.1103\/PhysRevLett.103.150502","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Timo Hillmann Lucas Berent Armanda O. Quintavalle Jens Eisert Robert Wille and Joschka Roffe. 2025. Localized statistics decoding for quantum low-density parity-check codes. Nature Communications 16 1 (2025) 8214. DOI:10.1038\/s41467-025-63214-7","DOI":"10.1038\/s41467-025-63214-7"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","unstructured":"He-Liang Huang Dachao Wu Daojin Fan and Xiaobo Zhu. 2020. Superconducting quantum computing: A review. Science China Information Sciences 63 8 (2020) 1\u201332. DOI:10.1007\/s11432-020-2881-9","DOI":"10.1007\/s11432-020-2881-9"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Petar Jurcevic Ali Javadi-Abhari Lev S. Bishop Isaac Lauer Daniela F. Bogorin Markus Brink Lauren Capelluto Oktay G\u00fcnl\u00fck Toshinari Itoko Naoki Kanazawa et\u00a0al. 2021. Demonstration of quantum volume 64 on a superconducting quantum computing system. Quantum Science and Technology 6 2 (Mar.2021) 025020. DOI:10.1088\/2058-9565\/abe519","DOI":"10.1088\/2058-9565\/abe519"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","unstructured":"P. Krantz M. Kjaergaard F. Yan T. P. Orlando S. Gustavsson and W. D. Oliver. 2019. A quantum engineer\u2019s guide to superconducting qubits. Applied Physics Reviews 6 2 (062019) 021318. DOI:10.1063\/1.5089550","DOI":"10.1063\/1.5089550"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Daniel Litinski. 2019. A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum 3 (Mar.2019) 128. DOI:10.22331\/q-2019-03-05-128","DOI":"10.22331\/q-2019-03-05-128"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Daniel Litinski. 2019. Magic state distillation: Not as costly as you think. Quantum 3 (Dec.2019) 205. DOI:10.22331\/q-2019-12-02-205","DOI":"10.22331\/q-2019-12-02-205"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Hannah J. Manetsch Gyohei Nomura Elie Bataille Xudong Lv Kon H. Leung and Manuel Endres. 2025. A tweezer array with 6100 highly coherent atomic qubits. Nature 647 8088 (2025) 60\u201367. DOI:10.1038\/s41586-025-09641-4","DOI":"10.1038\/s41586-025-09641-4"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Matt McEwen Dave Bacon and Craig Gidney. 2023. Relaxing hardware requirements for surface code circuits using time-dynamics. Quantum 7 (Nov.2023) 1172. DOI:10.22331\/q-2023-11-07-1172","DOI":"10.22331\/q-2023-11-07-1172"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2506.01779"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Lars Pause Lukas Sturm Marcel Mittenb\u00fchler Stephan Amann Tilman Preuschoff Dominik Sch\u00e4ffner Malte Schlosser and Gerhard Birkl. 2024. Supercharged two-dimensional tweezer array with more than 1000 atomic qubits. Optica 11 2 (Feb.2024) 222\u2013226. DOI:10.1364\/OPTICA.513551","DOI":"10.1364\/OPTICA.513551"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Timothy Proctor Kenneth Rudinger Kevin Young Erik Nielsen and Robin Blume-Kohout. 2022. Measuring the capabilities of quantum computers. Nature Physics 18 1 (2022) 75\u201379. DOI:10.1038\/s41567-021-01409-7","DOI":"10.1038\/s41567-021-01409-7"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Malte Schlosser Sascha Tichelmann Dominik Sch\u00e4ffner Daniel Ohl de Mello Moritz Hambach Jan Sch\u00fctz and Gerhard Birkl. 2023. Scalable multilayer architecture of assembled single-atom qubit arrays in a three-dimensional talbot tweezer lattice. Physical Review Letters 130 18 (May2023) 180601. DOI:10.1103\/PhysRevLett.130.180601","DOI":"10.1103\/PhysRevLett.130.180601"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Marc Serra-Peralta Mackenzie H. Shaw and Barbara M. Terhal. 2026. Decoding across transversal clifford gates in the surface code. PRX Quantum 7 1 (Feb 2026) 010335. DOI:10.1103\/sk5y-25b1","DOI":"10.1103\/sk5y-25b1"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Luka Skoric Dan E. Browne Kenton M. Barnes Neil I. Gillespie and Earl T. Campbell. 2023. Parallel window decoding enables scalable fault tolerant quantum computation. Nature Communications 14 1 (2023) 7040. DOI:10.1038\/s41467-023-42482-1","DOI":"10.1038\/s41467-023-42482-1"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Xinyu Tan Fang Zhang Rui Chao Yaoyun Shi and Jianxin Chen. 2023. Scalable surface-code decoders with parallelization in time. PRX Quantum 4 4 (Dec.2023) 040344. DOI:10.1103\/PRXQuantum.4.040344","DOI":"10.1103\/PRXQuantum.4.040344"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Barbara M. Terhal. 2015. Quantum error correction for quantum memories. Reviews of Modern Physics 87 2 (Apr.2015) 307\u2013346. DOI:10.1103\/RevModPhys.87.307","DOI":"10.1103\/RevModPhys.87.307"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Mark L. Turner Earl T. Campbell Ophelia Crawford Neil I. Gillespie and Joan Camps. 2026. Scalable decoding protocols for fast transversal logic in the surface code. PRX Quantum 7 1 (Jan 2026) 010320. DOI:10.1103\/nx6p-hjqy","DOI":"10.1103\/nx6p-hjqy"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3624062.3624211"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Joshua Viszlai Willers Yang Sophia Fuhui Lin Junyu Liu Natalia Nottingham Jonathan M. Baker and Frederic T. Chong. 2025. Matching generalized-bicycle codes to neutral atoms for low-overhead fault-tolerance. In 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) 1 (2025) 688\u2013699. DOI:10.1109\/QCE65121.2025.00080","DOI":"10.1109\/QCE65121.2025.00080"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2110.14108"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","unstructured":"Karen Wintersperger Florian Dommert Thomas Ehmer Andrey Hoursanov Johannes Klepsch Wolfgang Mauerer Georg Reuber Thomas Strohm Ming Yin and Sebastian Luber. 2023. Neutral atom quantum computing hardware: Performance and end-user perspective. EPJ Quantum Technology 10 1 (2023) 32. DOI:10.1140\/epjqt\/s40507-023-00190-1","DOI":"10.1140\/epjqt\/s40507-023-00190-1"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","unstructured":"Qian Xu J. Pablo Bonilla Ataides Christopher A. Pattison Nithin Raveendran Dolev Bluvstein Jonathan Wurtz Bane Vasi\u0107 Mikhail D. Lukin Liang Jiang and Hengyun Zhou. 2024. Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. Nature Physics 20 7 (2024) 1084\u20131090. DOI:10.1038\/s41567-024-02479-z","DOI":"10.1038\/s41567-024-02479-z"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3695053.3731039"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3797968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:35:22Z","timestamp":1776944122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3797968"],"URL":"https:\/\/doi.org\/10.1145\/3797968","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,20]]},"assertion":[{"value":"2025-11-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}