{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:02:40Z","timestamp":1782835360069,"version":"3.54.5"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"name":"National Key Research and Development Plan of China","award":["2024YFB4504003"],"award-info":[{"award-number":["2024YFB4504003"]}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["62072432"],"award-info":[{"award-number":["62072432"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>Distributed quantum computing (DQC) is a promising way to achieve large-scale quantum computing. However, mapping large-sized quantum circuits in DQC is a challenging job; for example, it is difficult to find an ideal cutting and mapping solution when many qubits, complicated qubit operations, and diverse QPUs are involved. In this study, we propose LarQucut, a new quantum circuit cutting and mapping approach for large-sized circuits in DQC. LarQucut has several new designs. (1) LarQucut can have cutting solutions that use fewer cuts, and it does not cut a circuit into independent sub-circuits, therefore reducing the overall cutting and computing overheads. (2) LarQucut finds isomorphic sub-circuits and reuses their execution results. So, LarQucut can reduce the number of sub-circuits that need to be executed to reconstruct the large circuit's output, reducing the time spent on sampling the sub-circuits. (3) We design an adaptive quantum circuit mapping approach, which identifies qubit interaction patterns and accordingly enables the best-fit mapping policy in DQC. The experimental results show that, for large circuits with hundreds to thousands of qubits in DQC, LarQucut can provide a better cutting and mapping solution with lower overall overheads and achieves results closer to the ground truth.<\/jats:p>","DOI":"10.1145\/3730585","type":"journal-article","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T07:24:26Z","timestamp":1744961066000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["LarQucut: A New Cutting and Mapping Approach for Large-sized Quantum Circuits in Distributed Quantum Computing (DQC) Environments"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8828-1404","authenticated-orcid":false,"given":"Xinglei","family":"Dou","sequence":"first","affiliation":[{"name":"Beihang University","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4854-7382","authenticated-orcid":false,"given":"Lei","family":"Liu","sequence":"additional","affiliation":[{"name":"Beihang University","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4449-8732","authenticated-orcid":false,"given":"Zhuohao","family":"Wang","sequence":"additional","affiliation":[{"name":"Beihang University","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4177-5724","authenticated-orcid":false,"given":"Pengyu","family":"Li","sequence":"additional","affiliation":[{"name":"Beihang University","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"key":"e_1_3_2_2_2","article-title":"A fast quantum mechanical algorithm for database search","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In STOC.","journal-title":"STOC"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"e_1_3_2_5_2","unstructured":"Yuval Boger. 2024. Crossing the Quantum Threshold: The Path to 10 000 Qubits. Retrieved 28 April 2025 from https:\/\/www.hpcwire.com\/2024\/04\/15\/crossing-the-quantum-threshold-the-path-to-10000-qubits\/"},{"key":"e_1_3_2_6_2","unstructured":"Chrissy Sexton. 2024. Quantum computer built by Google can instantly execute a task that would normally take 47 years. Retrieved 28 April 2025 from https:\/\/www.earth.com\/news\/quantum-computer-can-instantly-execute-a-task-that-would-normally-take-47-years\/"},{"key":"e_1_3_2_7_2","unstructured":"IBM. 2022. IBM Unveils 400 Qubit-Plus Quantum Processor and Next-Generation IBM Quantum System Two. Retrieved 28 April 2025 from https:\/\/newsroom.ibm.com\/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two"},{"key":"e_1_3_2_8_2","volume-title":"Quantum","author":"Preskill John","unstructured":"John Preskill. Quantum computing in the NISQ era and beyond. Quantum 2 (2018), 79."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446758"},{"key":"e_1_3_2_10_2","article-title":"AutoComm: A framework for enabling efficient communication in distributed quantum programs","author":"Wu Anbang","year":"2022","unstructured":"Anbang Wu, Hezi Zhang, Gushu Li, Alireza Shabani, Yuan Xie, and Yufei Ding. 2022. AutoComm: A framework for enabling efficient communication in distributed quantum programs. In MICRO.","journal-title":"MICRO"},{"key":"e_1_3_2_11_2","article-title":"QuComm: Optimizing collective communication for distributed quantum computing","author":"Wu Anbang","year":"2023","unstructured":"Anbang Wu, Yufei Ding, and Ang Li. 2023. QuComm: Optimizing collective communication for distributed quantum computing. In MICRO.","journal-title":"MICRO"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Michael A. Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information. 2002.","DOI":"10.1119\/1.1463744"},{"key":"e_1_3_2_13_2","unstructured":"Aditya Pawar Yingheng Li Zewei Mo Yanan Guo Youtao Zhang Xulong Tang and Jun Yang. Integrated qubit reuse and circuit cutting for large quantum circuit evaluation. arXiv:2312.10298. Retrieved from https:\/\/arxiv.org\/abs\/2312.10298."},{"key":"e_1_3_2_14_2","article-title":"Optimal partitioning of quantum circuits using gate cuts and wire cuts","author":"Brandhofer Sebastian","year":"2023","unstructured":"Sebastian Brandhofer, Ilia Polian, and Kevin Krsulich. 2023. Optimal partitioning of quantum circuits using gate cuts and wire cuts. In Quantum Software, (2023).","journal-title":"Quantum Software"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.150504"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/abd7bc"},{"key":"e_1_3_2_17_2","unstructured":"Anbang Wu Yufei Ding and Ang Li. CollComm: Enabling efficient collective quantum communication based on EPR buffering. arXiv:2208.06724v2. Retrieved from https:\/\/arxiv.org\/abs\/2208.06724v2"},{"key":"e_1_3_2_18_2","article-title":"Experimental simulation of larger quantum circuits with fewer superconducting qubits","author":"Ying Chong","year":"2023","unstructured":"Chong Ying, Bin Cheng, Youwei Zhao, He-Liang Huang, Yu-Ning Zhang, Ming Gong, Yulin Wu, Shiyu Wang, Futian Liang, Jin Lin, et al. 2023. Experimental simulation of larger quantum circuits with fewer superconducting qubits. Physical Review Letters 130, 11 (2023), 110601.","journal-title":"Physical Review Letters"},{"key":"e_1_3_2_19_2","article-title":"Elucidating reaction mechanisms on quantum computers","author":"Reiher Markus","year":"2016","unstructured":"Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer. 2016. Elucidating reaction mechanisms on quantum computers. Physical Sciences 114, 29 (2016), 7555--7560.","journal-title":"Physical Sciences"},{"key":"e_1_3_2_20_2","unstructured":"Gurobi. 2025. The Leader in Decision Intelligence Technology - Gurobi Optimization. Retrieved 28 April 2025 from https:\/\/www.gurobi.com\/"},{"key":"e_1_3_2_21_2","article-title":"Compiler design for distributed quantum computing","author":"Ferrari Davide","unstructured":"Davide Ferrari, Angela Sara Cacciapuoti, Michele Amoretti, and Marcello Caleffi. Compiler design for distributed quantum computing. Quantum Internet.","journal-title":"Quantum Internet"},{"key":"e_1_3_2_22_2","article-title":"MECH: Multi-entry communication highway for superconducting quantum chiplets","author":"Zhang Hezi","year":"2024","unstructured":"Hezi Zhang, Hassan Shapourian, Keyi Yin, Alireza Shabani, Anbang Wu, and Yufei Ding. 2024. MECH: Multi-entry communication highway for superconducting quantum chiplets. In ASPLOS.","journal-title":"ASPLOS"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-022-01207-9"},{"key":"e_1_3_2_24_2","unstructured":"Ali Javadi-Abhari Matthew Treinish Kevin Krsulich Christopher J. Wood Jake Lishman Julien Gacon Simon Martiel Paul D. Nation Lev S. Bishop Andrew W. Cross et al. Quantum computing with Qiskit. arXiv:2405.08810. Retrieved from https:\/\/arxiv.org\/abs\/2405.08810"},{"key":"e_1_3_2_25_2","unstructured":"Agata M. Branczyk Almudena Carrera Vazquez Daniel J. Egger Bryce Fuller Julien Gacon James R. Garrison Jennifer R. Glick Caleb Johnson Saasha Joshi Edwin Pednault et al. 2024. Circuit Knitting Toolbox. Retrieved 21 April 2024 from https:\/\/github.com\/Qiskit-Extensions\/circuit-knitting-toolbox"},{"key":"e_1_3_2_26_2","unstructured":"Anuranan Das and Stephen DiAdamo. 2022. diskit: Distributed QC for Qiskit. Retrieved 21 April 2024 from https:\/\/github.com\/Interlin-q\/diskit"},{"key":"e_1_3_2_27_2","article-title":"Compiler design for distributed quantum computing.","author":"Ferrari Davide","unstructured":"Davide Ferrari, Angela Sara Cacciapuoti, Michele Amoretti, and Marcello Caleffi. Compiler design for distributed quantum computing. Quantum Internet 2 (2021), 1--20.","journal-title":"Quantum Internet"},{"key":"e_1_3_2_28_2","article-title":"Mapping quantum algorithms to multi-core quantum computing architectures","author":"Ovide Anabel","year":"2023","unstructured":"Anabel Ovide, Santiago Rodrigo, Medina Bandic, Hans Van Someren, Sebastian Feld, Sergi Abadal, Eduard Alarcon, and Carmen G. Almudever. 2023. Mapping quantum algorithms to multi-core quantum computing architectures. In ISCAS.","journal-title":"ISCAS"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2023.3303935"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_31_2","unstructured":"Marcello Caleffi Michele Amoretti Davide Ferrari Daniele Cuomo Jessica Illiano Antonio Manzalini and Angela Sara Cacciapuoti. Distributed quantum computing: A survey. arXiv:2212.10609. Retrieved from https:\/\/arxiv.org\/abs\/2212.10609."},{"key":"e_1_3_2_32_2","article-title":"Tackling the qubit mapping problem for NISQ-era quantum devices","author":"Li Gushu","year":"2019","unstructured":"Gushu Li, Yufei Ding, and Yuan Xie. 2019. Tackling the qubit mapping problem for NISQ-era quantum devices. In ASPLOS.","journal-title":"ASPLOS"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3631525"},{"key":"e_1_3_2_34_2","article-title":"A fault-tolerant million qubit-scale distributed quantum computer","author":"Kim Junpyo","year":"2024","unstructured":"Junpyo Kim, Dongmoon Min, Jungmin Cho, Hyeonseong Jeong, Ilkwon Byun, Junhyuk Choi, Juwon Hong, and Jangwoo Kim. 2024. A fault-tolerant million qubit-scale distributed quantum computer. In ASPLOS.","journal-title":"ASPLOS"},{"key":"e_1_3_2_35_2","unstructured":"IBM. 2024. IBM Quantum Experience. Retrieved from https:\/\/quantum-computing.ibm.com\/"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3053921"},{"key":"e_1_3_2_38_2","article-title":"Time-sliced quantum circuit partitioning for modular architectures","author":"Baker Jonathan M.","year":"2020","unstructured":"Jonathan M. Baker, Casey Duckering, Alexander Hoover, and Frederic T. Chong. 2020. Time-sliced quantum circuit partitioning for modular architectures. In CF.","journal-title":"CF"},{"key":"e_1_3_2_39_2","unstructured":"Debasmita Bhoumik Ritajit Majumdar Amit Saha and Susmita Sur-Kolay. Distributed scheduling of quantum circuits with noise and time optimization. arXiv:2309.06005. Retrieved from https:\/\/arxiv.org\/abs\/2309.06005."},{"key":"e_1_3_2_40_2","article-title":"GTQCP: Greedy topology-aware quantum circuit partitioning","author":"Clark Joseph","year":"2023","unstructured":"Joseph Clark, Travis S. Humble, and Himanshu Thapliyal. 2023. GTQCP: Greedy topology-aware quantum circuit partitioning. In QCE.","journal-title":"QCE"},{"key":"e_1_3_2_41_2","article-title":"QPulseLib: Accelerating the pulse generation of quantum circuit with reusable patterns","author":"Tian Wuwei","year":"2023","unstructured":"Wuwei Tian, Xinhui Jia, Siwei Tan, Zixuan Song, Liqiang Lu, and Jianwei Yin. 2023. QPulseLib: Accelerating the pulse generation of quantum circuit with reusable patterns. In ICCAD.","journal-title":"ICCAD"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3730585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T09:41:50Z","timestamp":1760002910000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3730585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3730585"],"URL":"https:\/\/doi.org\/10.1145\/3730585","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"2024-10-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}