{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:49:27Z","timestamp":1775098167395,"version":"3.50.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Defense Advanced Research Projects Agency (DARPA) Quantum Benchmarking (QB) and Underexplored Systems for Utility-Scale Quantum Computing (US2QC) programs","award":["HR00112580540001 and HR0011261528"],"award-info":[{"award-number":["HR00112580540001 and HR0011261528"]}]},{"name":"DARPA QB program","award":["HR001122C0066"],"award-info":[{"award-number":["HR001122C0066"]}]},{"name":"Air Force Office of Scientific Research, Air Force Material Command, USAF","award":["FA9550-21-1-0041"],"award-info":[{"award-number":["FA9550-21-1-0041"]}]},{"name":"DARPA QB program","award":["HR00112230006 and HR001121S0026"],"award-info":[{"award-number":["HR00112230006 and HR001121S0026"]}]},{"name":"QuantERA grant EQUIP through the Academy of Finland","award":["352188"],"award-info":[{"award-number":["352188"]}]},{"DOI":"10.13039\/100016818","name":"UT-Battelle, LLC","doi-asserted-by":"crossref","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100016818","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Office of Science of the U.S. Department of Energy","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>\n            We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a\n            <jats:italic>post-hoc<\/jats:italic>\n            analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large practical quantum circuits by providing resource estimates for the ground state estimation of molecules. We find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.\n          <\/jats:p>","DOI":"10.1145\/3689826","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T10:15:46Z","timestamp":1724753746000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0652-9485","authenticated-orcid":false,"given":"Tyler","family":"Leblond","sequence":"first","affiliation":[{"name":"Computational Sciences and Engineering Division, Oak Ridge National Laboratory, Oak Ridge, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9835-8921","authenticated-orcid":false,"given":"Christopher","family":"Dean","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Dalhousie University, Halifax, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5671-8839","authenticated-orcid":false,"given":"George","family":"Watkins","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalto-universitetet, Aalto, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4810-9369","authenticated-orcid":false,"given":"Ryan","family":"Bennink","sequence":"additional","affiliation":[{"name":"Computational Sciences and Engineering Division, Oak Ridge National Laboratory, Oak Ridge, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,10,10]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05434-1"},{"issue":"7916","key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1038\/s41586-022-04819-6","article-title":"Fault-tolerant operation of a logical qubit in a diamond quantum processor","volume":"606","author":"Abobeih Mohamed H.","year":"2022","unstructured":"Mohamed H. Abobeih, Yu Wang, John Randall, S. J. H. Loenen, Christina E. Bradley, Matthew Markham, Daniel J. Twitchen, Barbara M. Terhal, and Tim H. Taminiau. 2022. Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature 606, 7916 (2022), 884\u2013889.","journal-title":"Nature"},{"issue":"13","key":"e_1_3_3_4_2","doi-asserted-by":"crossref","first-page":"130501","DOI":"10.1103\/PhysRevLett.129.130501","article-title":"High fidelity state preparation and measurement of ion hyperfine qubits with i> 1 2","volume":"129","author":"An Fangzhao Alex","year":"2022","unstructured":"Fangzhao Alex An, Anthony Ransford, Andrew Schaffer, Lucas R. Sletten, John Gaebler, James Hostetter, and Grahame Vittorini. 2022. High fidelity state preparation and measurement of ion hyperfine qubits with i> 1 2. Physical Review Letters 129, 13 (2022), 130501.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.020342"},{"key":"e_1_3_3_6_2","article-title":"Assessing requirements to scale to practical quantum advantage","author":"Beverland Michael E.","year":"2022","unstructured":"Michael E. Beverland, Prakash Murali, Matthias Troyer, Krysta M. Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, and Alexander Vaschillo. 2022. Assessing requirements to scale to practical quantum advantage. arXiv preprint arXiv:2211.07629 (2022).","journal-title":"arXiv preprint arXiv:2211.07629"},{"issue":"2","key":"e_1_3_3_7_2","doi-asserted-by":"crossref","first-page":"021029","DOI":"10.1103\/PhysRevX.7.021029","article-title":"Poking holes and cutting corners to achieve Clifford gates with the surface code","volume":"7","author":"Brown Benjamin J.","year":"2017","unstructured":"Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Wootton. 2017. Poking holes and cutting corners to achieve Clifford gates with the surface code. Physical Review X 7, 2 (2017), 021029.","journal-title":"Physical Review X"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23460"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.023090"},{"issue":"1","key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"010331","DOI":"10.1103\/PRXQuantum.3.010331","article-title":"Universal quantum computing with twist-free and temporally encoded lattice surgery","volume":"3","author":"Chamberland Christopher","year":"2022","unstructured":"Christopher Chamberland and Earl T. Campbell. 2022. Universal quantum computing with twist-free and temporally encoded lattice surgery. PRX Quantum 3, 1 (2022), 010331.","journal-title":"PRX Quantum"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010329"},{"issue":"13","key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"130505","DOI":"10.1103\/PhysRevLett.127.130505","article-title":"High-fidelity bell-state preparation with ca+ 40 optical qubits","volume":"127","author":"Clark Craig R.","year":"2021","unstructured":"Craig R. Clark, Holly N. Tinkey, Brian C. Sawyer, Adam M. Meier, Karl A. Burkhardt, Christopher M. Seck, Christopher M. Shappert, Nicholas D. Guise, Curtis E. Volin, Spencer D. Fallek, et\u00a0al. 2021. High-fidelity bell-state preparation with ca+ 40 optical qubits. Physical Review Letters 127, 13 (2021), 130505.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_13_2","article-title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","author":"Silva M. P. da","year":"2024","unstructured":"M. P. da Silva, C. Ryan-Anderson, J. M. Bello-Rivas, A. Chernoguzov, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, D. Hayes, N. Hewitt, et\u00a0al. 2024. Demonstration of logical qubits and repeated error correction with better-than-physical error rates. arXiv preprint arXiv:2404.02280 (2024).","journal-title":"arXiv preprint arXiv:2404.02280"},{"key":"e_1_3_3_14_2","unstructured":"Nicolas Delfosse Andres Paz Alexander Vaschillo and Krysta M. Svore. 2023. How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off. (102023). arxiv:2310.15313 [quant-ph]."},{"key":"e_1_3_3_15_2","article-title":"Low overhead quantum computation using lattice surgery","author":"Fowler Austin G.","year":"2018","unstructured":"Austin G. Fowler and Craig Gidney. 2018. Low overhead quantum computation using lattice surgery. arXiv preprint arXiv:1808.06709 (2018).","journal-title":"arXiv preprint arXiv:1808.06709"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"issue":"7776","key":"e_1_3_3_17_2","first-page":"22","article-title":"The quantum gold rush","volume":"574","author":"Gibney Elizabeth","year":"2019","unstructured":"Elizabeth Gibney. 2019. The quantum gold rush. Nature 574, 7776 (2019), 22\u201324.","journal-title":"Nature"},{"key":"e_1_3_3_18_2","volume-title":"Stabilizer codes and quantum error correction","author":"Gottesman Daniel","year":"1997","unstructured":"Daniel Gottesman. 1997. Stabilizer codes and quantum error correction. California Institute of Technology. https:\/\/www.proquest.com\/dissertations-theses\/stabilizer-codes-quantum-error-correction\/docview\/304364982\/se-2?accountid=26379"},{"issue":"14","key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"140503","DOI":"10.1103\/PhysRevLett.127.140503","article-title":"Factoring 2048-bit RSA integers in 177 days with 13 436 qubits and a multimode memory","volume":"127","author":"Gouzien \u00c9lie","year":"2021","unstructured":"\u00c9lie Gouzien and Nicolas Sangouard. 2021. Factoring 2048-bit RSA integers in 177 days with 13 436 qubits and a multimode memory. Physical Review Letters 127, 14 (2021), 140503.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/2491956.2462177","volume-title":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"Green Alexander S.","year":"2013","unstructured":"Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, and Beno\u00eet Valiron. 2013. Quipper: A scalable quantum programming language. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. 333\u2013342."},{"issue":"1","key":"e_1_3_3_21_2","doi-asserted-by":"crossref","first-page":"013034","DOI":"10.1088\/1367-2630\/aa5709","article-title":"Lattice surgery translation for quantum computation","volume":"19","author":"Herr Daniel","year":"2017","unstructured":"Daniel Herr, Franco Nori, and Simon J. Devitt. 2017. Lattice surgery translation for quantum computation. New Journal of Physics 19, 1 (2017), 013034.","journal-title":"New Journal of Physics"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-017-0035-1"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/12\/123011"},{"issue":"2","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"023019","DOI":"10.1103\/PhysRevResearch.4.023019","article-title":"Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules","volume":"4","author":"Kim Isaac H.","year":"2022","unstructured":"Isaac H. Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, and Eunseok Lee. 2022. Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules. Physical Review Research 4, 2 (2022), 023019.","journal-title":"Physical Review Research"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"e_1_3_3_26_2","article-title":"Some improvements to product formula circuits for Hamiltonian simulation","author":"Kornell Andre","year":"2023","unstructured":"Andre Kornell and Peter Selinger. 2023. Some improvements to product formula circuits for Hamiltonian simulation. arXiv preprint arXiv:2310.12256 (2023).","journal-title":"arXiv preprint arXiv:2310.12256"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3528416.3530237"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3624062.3624214"},{"key":"e_1_3_3_29_2","volume-title":"ASCR Workshop on Basic Research Needs in Quantum Computing and Networking","author":"LeBlond Tyler","year":"2023","unstructured":"Tyler LeBlond, Xiao Xiao, Eugene Dumitrescu, Ryan Bennink, and Alexandru Paler. 2023. On the need for extensible quantum compilers with verification. In ASCR Workshop on Basic Research Needs in Quantum Computing and Networking. https:\/\/custom.cvent.com\/DCBD4ADAAD004096B1E4AD96F3C8049E\/files\/event\/6e6af0a541664baa9bd2bc48ab7be5c3\/1f0b81de978241df848f5f375b8cf4b0.pdf"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/17\/2\/023037"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-03-05-128"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-12-02-205"},{"key":"e_1_3_3_33_2","article-title":"Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections","author":"Litinski Daniel","year":"2022","unstructured":"Daniel Litinski and Naomi Nickerson. 2022. Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections. arXiv preprint arXiv:2211.15465 (2022).","journal-title":"arXiv preprint arXiv:2211.15465"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-05-04-62"},{"key":"e_1_3_3_35_2","first-page":"1","volume-title":"2020 IEEE Globecom Workshops (GC Wkshps)","author":"Paler Alexandru","year":"2020","unstructured":"Alexandru Paler and Austin G. Fowler. 2020. OpenSurgery for topological assemblies. In 2020 IEEE Globecom Workshops (GC Wkshps). IEEE, 1\u20134."},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565271"},{"key":"e_1_3_3_37_2","volume-title":"An Assessment of the US and Chinese Industrial Bases in Quantum Technology","author":"Parker Edward","year":"2022","unstructured":"Edward Parker, Daniel Gonzales, Ajoy K. Kochhar, Sydney Litterer, Kathryn O\u2019Connor, Jon Schmid, Keller Scholl, Richard Silberglitt, Joan Chang, Christopher A. Eusebi, et\u00a0al. 2022. An Assessment of the US and Chinese Industrial Bases in Quantum Technology. Rand Corporation."},{"key":"e_1_3_3_38_2","unstructured":"Quantinuum. 2023. Quantinuum System Model H1: Product Data Sheet."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062300"},{"issue":"4","key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"041058","DOI":"10.1103\/PhysRevX.11.041058","article-title":"Realization of real-time fault-tolerant quantum error correction","volume":"11","author":"Ryan-Anderson Ciaran","year":"2021","unstructured":"Ciaran Ryan-Anderson, Justin G. Bohnet, Kenny Lee, Daniel Gresh, Aaron Hankin, J. P. Gaebler, David Francois, Alexander Chernoguzov, Dominic Lucchetti, Natalie C. Brown, et\u00a0al. 2021. Realization of real-time fault-tolerant quantum error correction. Physical Review X 11, 4 (2021), 041058.","journal-title":"Physical Review X"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.87.307"},{"key":"e_1_3_3_42_2","article-title":"An architecture for improved surface code connectivity in neutral atoms","author":"Viszlai Joshua","year":"2023","unstructured":"Joshua Viszlai, Sophia Fuhui Lin, Siddharth Dangwal, Jonathan M. Baker, and Frederic T. Chong. 2023. An architecture for improved surface code connectivity in neutral atoms. arXiv preprint arXiv:2309.13507 (2023).","journal-title":"arXiv preprint arXiv:2309.13507"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ab0199"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-05-22-1354"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-031-62076-8_10","volume-title":"International Conference on Reversible Computation","author":"Wesley Scott","year":"2024","unstructured":"Scott Wesley. 2024. LinguaQuanta: Towards a quantum transpiler between OpenQASM and Quipper. In International Conference on Reversible Computation. Springer, 142\u2013160."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:11Z","timestamp":1750291571000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,10]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3689826"],"URL":"https:\/\/doi.org\/10.1145\/3689826","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,10]]},"assertion":[{"value":"2023-12-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}