{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T20:02:44Z","timestamp":1781640164735,"version":"3.54.5"},"reference-count":98,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T00:00:00Z","timestamp":1677196800000},"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":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"<jats:p>\n            Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario,\n            <jats:italic>telegates<\/jats:italic>\n            represent the fundamental remote (inter-processor) operations. Each telegate consists of several tasks: (i) entanglement generation and distribution, (ii) local operations, and (iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of distributed entangled states. Specifically, we formulated the distributed compilation problem as a dynamic network flow. To enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegate tasks.\n          <\/jats:p>\n          <jats:p>To evaluate our framework, we split the problem into three sub-problems, and solve it by means of an approximation routine. Experiments demonstrate that the run-time is resistant to the problem size scaling. Moreover, we apply the proposed algorithm to compile circuits under different topologies, showing that topologies with a higher ratio between edges and nodes give rise to shallower circuits.<\/jats:p>\n          <jats:p\/>","DOI":"10.1145\/3579367","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T12:06:31Z","timestamp":1673957191000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Optimized Compiler for Distributed Quantum Computing"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9361-5797","authenticated-orcid":false,"given":"Daniele","family":"Cuomo","sequence":"first","affiliation":[{"name":"Department of Physics, University of Naples Federico II, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5726-5489","authenticated-orcid":false,"given":"Marcello","family":"Caleffi","sequence":"additional","affiliation":[{"name":"DIETI, University of Naples Federico II, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7222-5722","authenticated-orcid":false,"given":"Kevin","family":"Krsulich","sequence":"additional","affiliation":[{"name":"IBM Quantum, T. J. Watson Research Center, New York"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4540-5004","authenticated-orcid":false,"given":"Filippo","family":"Tramonto","sequence":"additional","affiliation":[{"name":"Kyndryl Italia Innovation Services, Segrate (MI), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1692-9047","authenticated-orcid":false,"given":"Gabriele","family":"Agliardi","sequence":"additional","affiliation":[{"name":"Department of Physics, Politecnico di Milano and IBM Italia, Segrate (MI)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9839-202X","authenticated-orcid":false,"given":"Enrico","family":"Prati","sequence":"additional","affiliation":[{"name":"Department of Physics, Universit\u00e1 degli Studi di Milano and IFN-CNR, Milano, Italia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2927","authenticated-orcid":false,"given":"Angela Sara","family":"Cacciapuoti","sequence":"additional","affiliation":[{"name":"DIETI, University of Naples Federico II, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,2,24]]},"reference":[{"issue":"5","key":"e_1_3_3_2_2","doi-asserted-by":"crossref","first-page":"052328","DOI":"10.1103\/PhysRevA.70.052328","article-title":"Improved simulation of stabilizer circuits","volume":"70","author":"Aaronson Scott","year":"2004","unstructured":"Scott Aaronson and Daniel Gottesman. 2004. Improved simulation of stabilizer circuits. Physical Review A 70, 5 (2004), 052328.","journal-title":"Physical Review A"},{"key":"e_1_3_3_3_2","unstructured":"Ravindra K. Ahuja Thomas L. Magnanti and James B. Orlin. 1988. Network flows. (1988)."},{"issue":"11","key":"e_1_3_3_4_2","doi-asserted-by":"crossref","first-page":"113060","DOI":"10.1088\/1367-2630\/17\/11\/113060","article-title":"Universal gate-set for trapped-ion qubits using a narrow linewidth diode laser","volume":"17","author":"Akerman Nitzan","year":"2015","unstructured":"Nitzan Akerman, Nir Navon, Shlomi Kotler, Yinnon Glickman, and Roee Ozeri. 2015. Universal gate-set for trapped-ion qubits using a narrow linewidth diode laser. New Journal of Physics 17, 11 (2015), 113060.","journal-title":"New Journal of Physics"},{"issue":"10","key":"e_1_3_3_5_2","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","article-title":"Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning","volume":"33","author":"Amy Matthew","year":"2014","unstructured":"Matthew Amy, Dmitri Maslov, and Michele Mosca. 2014. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33, 10 (2014), 1476\u20131489.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"032308","DOI":"10.1103\/PhysRevA.100.032308","article-title":"Automated distribution of quantum circuits via hypergraph partitioning","volume":"100","author":"Andres-Martinez Pablo","year":"2019","unstructured":"Pablo Andres-Martinez and Chris Heunen. 2019. Automated distribution of quantum circuits via hypergraph partitioning. Physical Review A 100, 3 (2019), 032308.","journal-title":"Physical Review A"},{"issue":"9","key":"e_1_3_3_7_2","doi-asserted-by":"crossref","first-page":"093021","DOI":"10.1088\/1367-2630\/16\/9\/093021","article-title":"The ZX-calculus is complete for stabilizer quantum mechanics","volume":"16","author":"Backens Miriam","year":"2014","unstructured":"Miriam Backens. 2014. The ZX-calculus is complete for stabilizer quantum mechanics. New Journal of Physics 16, 9 (2014), 093021.","journal-title":"New Journal of Physics"},{"key":"e_1_3_3_8_2","article-title":"High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions","author":"Ballance C. J.","year":"2014","unstructured":"C. J. Ballance, T. P. Harty, N. M. Linke, and D. M. Lucas. 2014. High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions. arXiv preprint arXiv:1406.5473 (2014).","journal-title":"arXiv preprint arXiv:1406.5473"},{"issue":"2153","key":"e_1_3_3_9_2","doi-asserted-by":"crossref","first-page":"20120686","DOI":"10.1098\/rspa.2012.0686","article-title":"Efficient distributed quantum computing","volume":"469","author":"Beals Robert","year":"2013","unstructured":"Robert Beals, Stephen Brierley, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, and Mark Stather. 2013. Efficient distributed quantum computing. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, 2153 (2013), 20120686.","journal-title":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences"},{"key":"e_1_3_3_10_2","volume-title":"28th International Conference on Automated Planning and Scheduling","author":"Booth Kyle E C.","year":"2018","unstructured":"Kyle E C. Booth, Minh Do, J. Christopher Beck, Eleanor Rieffel, Davide Venturelli, and Jeremy Frank. 2018. Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In 28th International Conference on Automated Planning and Scheduling."},{"key":"e_1_3_3_11_2","volume-title":"Eleventh Annual Symposium on Combinatorial Search","author":"Botea Adi","year":"2018","unstructured":"Adi Botea, Akihiro Kishimoto, and Radu Marinescu. 2018. On the complexity of quantum circuit compilation. In Eleventh Annual Symposium on Combinatorial Search."},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/ASP-DAC52403.2022.9712555","volume-title":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","author":"Burgholzer Lukas","year":"2022","unstructured":"Lukas Burgholzer, Sarah Schneider, and Robert Wille. 2022. Limiting the search space in optimal quantum circuit mapping. In 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, 466\u2013471."},{"issue":"1","key":"e_1_3_3_13_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/MNET.001.1900092","article-title":"Quantum internet: Networking challenges in distributed quantum computing","volume":"34","author":"Cacciapuoti Angela Sara","year":"2019","unstructured":"Angela Sara Cacciapuoti, Marcello Caleffi, Francesco Tafuri, Francesco Saverio Cataliotti, Stefano Gherardini, and Giuseppe Bianchi. 2019. Quantum internet: Networking challenges in distributed quantum computing. IEEE Network 34, 1 (2019), 137\u2013143.","journal-title":"IEEE Network"},{"issue":"6","key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"3808","DOI":"10.1109\/TCOMM.2020.2978071","article-title":"When entanglement meets classical communications: Quantum teleportation for the quantum internet","volume":"68","author":"Cacciapuoti Angela Sara","year":"2020","unstructured":"Angela Sara Cacciapuoti, Marcello Caleffi, Rodney Van Meter, and Lajos Hanzo. 2020. When entanglement meets classical communications: Quantum teleportation for the quantum internet. IEEE Transactions on Communications 68, 6 (2020), 3808\u20133833.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3464693","article-title":"Completeness of graphical languages for mixed state quantum mechanics","volume":"2","author":"Carette Titouan","year":"2021","unstructured":"Titouan Carette, Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. 2021. Completeness of graphical languages for mixed state quantum mechanics. ACM Transactions on Quantum Computing 2, 4 (2021), 1\u201328.","journal-title":"ACM Transactions on Quantum Computing"},{"issue":"7690","key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1038\/d41586-018-01835-3","article-title":"The quantum internet has arrived (and it hasn\u2019t)","volume":"554","author":"Castelvecchi Davide","year":"2018","unstructured":"Davide Castelvecchi. 2018. The quantum internet has arrived (and it hasn\u2019t). Nature 554, 7690 (2018), 289\u2013293.","journal-title":"Nature"},{"issue":"1","key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","article-title":"Approximation algorithms for the unsplittable flow problem","volume":"47","author":"Chakrabarti Amit","year":"2007","unstructured":"Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, and Amit Kumar. 2007. Approximation algorithms for the unsplittable flow problem. Algorithmica 47, 1 (2007), 53\u201378.","journal-title":"Algorithmica"},{"key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2020.3028172","article-title":"Entanglement distribution in a quantum network: A multicommodity flow-based approach","volume":"1","author":"Chakraborty Kaushik","year":"2020","unstructured":"Kaushik Chakraborty, David Elkouss, Bruno Rijsman, and Stephanie Wehner. 2020. Entanglement distribution in a quantum network: A multicommodity flow-based approach. IEEE Transactions on Quantum Engineering 1 (2020), 1\u201321.","journal-title":"IEEE Transactions on Quantum Engineering"},{"key":"e_1_3_3_19_2","first-page":"156","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"Chekuri Chandra","year":"2004","unstructured":"Chandra Chekuri, Sanjeev Khanna, and Bruce Shepherd. 2004. The all-or-nothing multicommodity flow problem. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 156\u2013165."},{"issue":"1","key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4086\/toc.2006.v002a007","article-title":"An  \\(\\mathcal {O}(\\sqrt {n})\\)  approximation and integrality gap for disjoint paths and unsplittable flow","volume":"2","author":"Chekuri Chandra","year":"2006","unstructured":"Chandra Chekuri, Sanjeev Khanna, and Bruce Shepherd. 2006. An \\(\\mathcal {O}(\\sqrt {n})\\) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing 2, 1 (2006), 137\u2013146.","journal-title":"Theory of Computing"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/11809678_54","volume-title":"International Computing and Combinatorics Conference","author":"Choi Dae-Sik","year":"2006","unstructured":"Dae-Sik Choi and In-Chan Choi. 2006. On the effectiveness of the linear programming relaxation of the 0-1 multi-commodity minimum cost network flow problem. In International Computing and Combinatorics Conference. Springer, 517\u2013526."},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TQE.2021.3090532","article-title":"Request scheduling in quantum networks","volume":"2","author":"Cicconetti Claudio","year":"2021","unstructured":"Claudio Cicconetti, Marco Conti, and Andrea Passarella. 2021. Request scheduling in quantum networks. IEEE Transactions on Quantum Engineering 2 (2021), 2\u201317.","journal-title":"IEEE Transactions on Quantum Engineering"},{"issue":"1","key":"e_1_3_3_23_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1049\/iet-qtc.2020.0002","article-title":"Towards a distributed quantum computing ecosystem","volume":"1","author":"Cuomo Daniele","year":"2020","unstructured":"Daniele Cuomo, Marcello Caleffi, and Angela Sara Cacciapuoti. 2020. Towards a distributed quantum computing ecosystem. IET Quantum Communication 1, 1 (2020), 3\u20138.","journal-title":"IET Quantum Communication"},{"issue":"9","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"3271","DOI":"10.1007\/s10773-021-04904-y","article-title":"A new approach for optimization of distributed quantum circuits","volume":"60","author":"Dadkhah Davood","year":"2021","unstructured":"Davood Dadkhah, Mariam Zomorodi, and Seyed Ebrahim Hosseini. 2021. A new approach for optimization of distributed quantum circuits. International Journal of Theoretical Physics 60, 9 (2021), 3271\u20133285.","journal-title":"International Journal of Theoretical Physics"},{"issue":"9","key":"e_1_3_3_25_2","doi-asserted-by":"crossref","first-page":"3494","DOI":"10.1007\/s10773-021-04920-y","article-title":"Improving the teleportation cost in distributed quantum circuits based on commuting of gates","volume":"60","author":"Daei Omid","year":"2021","unstructured":"Omid Daei, Keivan Navi, and Mariam Zomorodi. 2021. Improving the teleportation cost in distributed quantum circuits based on commuting of gates. International Journal of Theoretical Physics 60, 9 (2021), 3494\u20133513.","journal-title":"International Journal of Theoretical Physics"},{"issue":"12","key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"3804","DOI":"10.1007\/s10773-020-04633-8","article-title":"Optimized quantum circuit partitioning","volume":"59","author":"Daei Omid","year":"2020","unstructured":"Omid Daei, Keivan Navi, and Mariam Zomorodi-Moghadam. 2020. Optimized quantum circuit partitioning. International Journal of Theoretical Physics 59, 12 (2020), 3804\u20133820.","journal-title":"International Journal of Theoretical Physics"},{"issue":"10","key":"e_1_3_3_27_2","first-page":"1","article-title":"A dynamic programming approach for distributing quantum circuits by bipartite graphs","volume":"19","author":"Davarzani Zohreh","year":"2020","unstructured":"Zohreh Davarzani, Mariam Zomorodi-Moghadam, Mahboobeh Houshmand, and Mostafa Nouri-Baygi. 2020. A dynamic programming approach for distributing quantum circuits by bipartite graphs. Quantum Information Processing 19, 10 (2020), 1\u201318.","journal-title":"Quantum Information Processing"},{"issue":"4","key":"e_1_3_3_28_2","doi-asserted-by":"crossref","first-page":"042318","DOI":"10.1103\/PhysRevA.68.042318","article-title":"Clifford group, stabilizer states, and linear and quadratic operations over GF (2)","volume":"68","author":"Dehaene Jeroen","year":"2003","unstructured":"Jeroen Dehaene and Bart De Moor. 2003. Clifford group, stabilizer states, and linear and quadratic operations over GF (2). Physical Review A 68, 4 (2003), 042318.","journal-title":"Physical Review A"},{"key":"e_1_3_3_29_2","article-title":"A graphical approach to measurement-based quantum computing","author":"Duncan Ross","year":"2012","unstructured":"Ross Duncan. 2012. A graphical approach to measurement-based quantum computing. arXiv preprint arXiv:1203.6242 (2012).","journal-title":"arXiv preprint arXiv:1203.6242"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.22331\/q-2020-06-04-279","article-title":"Graph-theoretic simplification of quantum circuits with the ZX-calculus","volume":"4","author":"Duncan Ross","year":"2020","unstructured":"Ross Duncan, Aleks Kissinger, Simon Perdrix, and John Van De Wetering. 2020. Graph-theoretic simplification of quantum circuits with the ZX-calculus. Quantum 4 (2020), 279.","journal-title":"Quantum"},{"issue":"4","key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"043001","DOI":"10.1088\/1361-6404\/aa6df7","article-title":"Towards a quantum internet","volume":"38","author":"D\u00fcr Wolfgang","year":"2017","unstructured":"Wolfgang D\u00fcr, Raphael Lamprecht, and Stefan Heusler. 2017. Towards a quantum internet. European Journal of Physics 38, 4 (2017), 043001.","journal-title":"European Journal of Physics"},{"issue":"1","key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"010309","DOI":"10.1103\/PRXQuantum.3.010309","article-title":"Doubling the size of quantum simulators by entanglement forging","volume":"3","author":"Eddins Andrew","year":"2022","unstructured":"Andrew Eddins, Mario Motta, Tanvi P. Gujarati, Sergey Bravyi, Antonio Mezzacapo, Charles Hadfield, and Sarah Sheldon. 2022. Doubling the size of quantum simulators by entanglement forging. PRX Quantum 3, 1 (2022), 010309.","journal-title":"PRX Quantum"},{"key":"e_1_3_3_33_2","first-page":"184","volume-title":"16th Annual Symposium on Foundations of Computer Science","author":"Even Shimon","year":"1975","unstructured":"Shimon Even, Alon Itai, and Adi Shamir. 1975. On the complexity of time table and multi-commodity flow problems. In 16th Annual Symposium on Foundations of Computer Science. IEEE, 184\u2013193."},{"key":"e_1_3_3_34_2","unstructured":"Li Fei. 2017. Multicommodity Flows and Disjoint Paths Problem. https:\/\/cs.gmu.edu\/~lifei\/teaching\/cs684spring17\/lec8.pdf. (2017)."},{"key":"e_1_3_3_35_2","article-title":"Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks","author":"Ferrari Davide","year":"2021","unstructured":"Davide Ferrari and Michele Amoretti. 2021. Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks. arXiv preprint arXiv:2108.11874 (2021).","journal-title":"arXiv preprint arXiv:2108.11874"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2021.3053921","article-title":"Compiler design for distributed quantum computing","volume":"2","author":"Ferrari Davide","year":"2021","unstructured":"Davide Ferrari, Angela Sara Cacciapuoti, Michele Amoretti, and Marcello Caleffi. 2021. Compiler design for distributed quantum computing. IEEE Transactions on Quantum Engineering 2 (2021), 1\u201320.","journal-title":"IEEE Transactions on Quantum Engineering"},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-47867-1_4","volume-title":"International Conference on Integer Programming and Combinatorial Optimization","author":"Fleischer Lisa","year":"2002","unstructured":"Lisa Fleischer and Martin Skutella. 2002. The quickest multicommodity flow problem. In International Conference on Integer Programming and Combinatorial Optimization. Springer, 36\u201353."},{"issue":"1","key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","article-title":"A suggested computation for maximal multi-commodity network flows","volume":"5","author":"Ford Jr. Lester R.","year":"1958","unstructured":"Lester R. Ford Jr. and D. R. Fulkerson. 1958. A suggested computation for maximal multi-commodity network flows. Management Science 5, 1 (1958), 97.","journal-title":"Management Science"},{"issue":"3","key":"e_1_3_3_39_2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","article-title":"Constructing maximal dynamic flows from static flows","volume":"6","author":"Ford Jr. Lester R.","year":"1958","unstructured":"Lester R. Ford Jr. and Delbert Ray Fulkerson. 1958. Constructing maximal dynamic flows from static flows. Operations Research 6, 3 (1958), 419\u2013433.","journal-title":"Operations Research"},{"key":"e_1_3_3_40_2","volume-title":"35th International Symposium on Distributed Computing","author":"G. Sundaram Ranjani","year":"2021","unstructured":"Ranjani G. Sundaram, Himanshu Gupta, and C R. Ramakrishnan. 2021. Efficient distribution of quantum circuits. In 35th International Symposium on Distributed Computing. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_3_41_2","unstructured":"Jay Gambetta. 2022. Expanding the IBM Quantum roadmap to anticipate the future of quantum-centric supercomputing. (2022)."},{"issue":"1","key":"e_1_3_3_42_2","first-page":"1","article-title":"Entanglement across separate silicon dies in a modular superconducting qubit device","volume":"7","author":"Gold Alysson","year":"2021","unstructured":"Alysson Gold, J. P. Paquette, Anna Stockklauser, Matthew J. Reagor, M. Sohaib Alam, Andrew Bestwick, Nicolas Didier, Ani Nersisyan, Feyza Oruc, Armin Razavi, et al. 2021. Entanglement across separate silicon dies in a modular superconducting qubit device. npj Quantum Information 7, 1 (2021), 1\u201310.","journal-title":"npj Quantum Information"},{"issue":"1","key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","article-title":"Theory of fault-tolerant quantum computation","volume":"57","author":"Gottesman Daniel","year":"1998","unstructured":"Daniel Gottesman. 1998. Theory of fault-tolerant quantum computation. Physical Review A 57, 1 (1998), 127.","journal-title":"Physical Review A"},{"issue":"22","key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"220501","DOI":"10.1103\/PhysRevLett.113.220501","article-title":"High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit","volume":"113","author":"Harty T. P.","year":"2014","unstructured":"T. P. Harty, D. T. C. Allcock, C. J. Ballance, L. Guidoni, H. A. Janacek, N. M. Linke, D. N. Stacey, and D. M. Lucas. 2014. High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit. Physical Review Letters 113, 22 (2014), 220501.","journal-title":"Physical Review Letters"},{"issue":"1","key":"e_1_3_3_45_2","doi-asserted-by":"crossref","first-page":"015004","DOI":"10.1088\/2058-9565\/aad604","article-title":"An efficient quantum compiler that reduces T count","volume":"4","author":"Heyfron Luke E.","year":"2018","unstructured":"Luke E. Heyfron and Earl T. Campbell. 2018. An efficient quantum compiler that reduces T count. Quantum Science and Technology 4, 1 (2018), 015004.","journal-title":"Quantum Science and Technology"},{"key":"e_1_3_3_46_2","first-page":"792","volume-title":"2021 26th Asia and South Pacific Design Automation Conference (ASP-DAC)","author":"Hillmich Stefan","year":"2021","unstructured":"Stefan Hillmich, Alwin Zulehner, and Robert Wille. 2021. Exploiting quantum teleportation in quantum circuit mapping. In 2021 26th Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, 792\u2013797."},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/3287624.3287701","volume-title":"Proceedings of the 24th Asia and South Pacific Design Automation Conference","author":"Itoko Toshinari","year":"2019","unstructured":"Toshinari Itoko, Rudy Raymond, Takashi Imamichi, Atsushi Matsuo, and Andrew W. Cross. 2019. Quantum circuit compilers using gate commutation rules. In Proceedings of the 24th Asia and South Pacific Design Automation Conference. 191\u2013196."},{"key":"e_1_3_3_48_2","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/3209108.3209131","volume-title":"Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","author":"Jeandel Emmanuel","year":"2018","unstructured":"Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. 2018. A complete axiomatisation of the ZX-calculus for Clifford+T quantum mechanics. In Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science. 559\u2013568."},{"issue":"6341","key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1126\/science.aan0070","article-title":"Entanglement distillation between solid-state quantum network nodes","volume":"356","author":"Kalb Norbert","year":"2017","unstructured":"Norbert Kalb, Andreas A. Reiserer, Peter C. Humphreys, Jacob J. W. Bakermans, Sten J. Kamerling, Naomi H. Nickerson, Simon C. Benjamin, Daniel J. Twitchen, Matthew Markham, and Ronald Hanson. 2017. Entanglement distillation between solid-state quantum network nodes. Science 356, 6341 (2017), 928\u2013932.","journal-title":"Science"},{"issue":"2","key":"e_1_3_3_50_2","doi-asserted-by":"crossref","first-page":"024003","DOI":"10.1088\/2058-9565\/ab7559","article-title":"A quantum-classical cloud platform optimized for variational hybrid algorithms","volume":"5","author":"Karalekas Peter J.","year":"2020","unstructured":"Peter J. Karalekas, Nikolas A. Tezak, Eric C. Peterson, Colm A. Ryan, Marcus P. da Silva, and Robert S. Smith. 2020. A quantum-classical cloud platform optimized for variational hybrid algorithms. Quantum Science and Technology 5, 2 (2020), 024003.","journal-title":"Quantum Science and Technology"},{"issue":"6890","key":"e_1_3_3_51_2","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1038\/nature00784","article-title":"Architecture for a large-scale ion-trap quantum computer","volume":"417","author":"Kielpinski David","year":"2002","unstructured":"David Kielpinski, Chris Monroe, and David J. Wineland. 2002. Architecture for a large-scale ion-trap quantum computer. Nature 417, 6890 (2002), 709\u2013711.","journal-title":"Nature"},{"issue":"7198","key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1038\/nature07127","article-title":"The quantum internet","volume":"453","author":"Kimble H. Jeff","year":"2008","unstructured":"H. Jeff Kimble. 2008. The quantum internet. Nature 453, 7198 (2008), 1023\u20131030.","journal-title":"Nature"},{"key":"e_1_3_3_53_2","article-title":"Reducing T-count with the ZX-calculus","author":"Kissinger Aleks","year":"2019","unstructured":"Aleks Kissinger and John van de Wetering. 2019. Reducing T-count with the ZX-calculus. arXiv preprint arXiv: 1903.10477 (2019).","journal-title":"arXiv preprint arXiv: 1903.10477"},{"key":"e_1_3_3_54_2","first-page":"229","volume-title":"Proceedings 16th International Conference onQuantum Physics and Logic","volume":"318","author":"Kissinger Aleks","year":"2020","unstructured":"Aleks Kissinger and John van de Wetering. 2020. PyZX: Large scale automated diagrammatic reasoning. In Proceedings 16th International Conference onQuantum Physics and Logic, Vol. 318. Open Publishing Association, 229\u2013241."},{"issue":"6","key":"e_1_3_3_55_2","first-page":"53","article-title":"Quantum computations: Algorithms and error correction","volume":"52","author":"Kitaev Aleksei Yur\u2019evich","year":"1997","unstructured":"Aleksei Yur\u2019evich Kitaev. 1997. Quantum computations: Algorithms and error correction. Uspekhi Matematicheskikh Nauk 52, 6 (1997), 53\u2013112.","journal-title":"Uspekhi Matematicheskikh Nauk"},{"issue":"1","key":"e_1_3_3_56_2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0021-9800(70)80013-8","article-title":"A matching theorem for graphs","volume":"8","author":"Kleitman D.","year":"1970","unstructured":"D. Kleitman, A. Martin-L\u00f6f, B. Rothschild, and A. Whinston. 1970. A matching theorem for graphs. Journal of Combinatorial Theory 8, 1 (1970), 104\u2013114.","journal-title":"Journal of Combinatorial Theory"},{"issue":"1","key":"e_1_3_3_57_2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/net.3230010107","article-title":"An algorithm for certain multi-commodity flow problems","volume":"1","author":"Kleitman Daniel J.","year":"1971","unstructured":"Daniel J. Kleitman. 1971. An algorithm for certain multi-commodity flow problems. Networks 1, 1 (1971), 75\u201390.","journal-title":"Networks"},{"key":"e_1_3_3_58_2","first-page":"184","volume-title":"SODA","author":"Kolman Petr","year":"2002","unstructured":"Petr Kolman and Christian Scheideler. 2002. Improved bounds for the unsplittable flow problem. In SODA, Vol. 2. 184\u2013193."},{"key":"e_1_3_3_59_2","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte Bernhard","year":"2006","unstructured":"Bernhard Korte and Jens Vygen. 2006. Multicommodity flows and edge-disjoint paths. In Combinatorial Optimization: Theory and Algorithms. Springer."},{"key":"e_1_3_3_60_2","volume-title":"Architectural Principles for a Quantum Internet.","author":"Kozlowski Wojciech","year":"2021","unstructured":"Wojciech Kozlowski, Stephanie Wehner, Rodney Van Meter, Bruno Rijsman, Angela Sara Cacciapuoti, and Marcello Caleffi. 2021. Architectural Principles for a Quantum Internet.Internet-Draft draft-irtf-qirg-principles-03. Internet Engineering Task Force. Work in Progress."},{"issue":"4","key":"e_1_3_3_61_2","doi-asserted-by":"crossref","first-page":"040503","DOI":"10.1103\/PhysRevLett.127.040503","article-title":"Optically heralded entanglement of superconducting systems in quantum networks","volume":"127","author":"Krastanov Stefan","year":"2021","unstructured":"Stefan Krastanov, Hamza Raniwala, Jeffrey Holzgrafe, Kurt Jacobs, Marko Lon\u010dar, Matthew J. Reagor, and Dirk R. Englund. 2021. Optically heralded entanglement of superconducting systems in quantum networks. Physical Review Letters 127, 4 (2021), 040503.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_62_2","first-page":"1001","volume-title":"Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems","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 Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems. 1001\u20131014."},{"issue":"2","key":"e_1_3_3_63_2","doi-asserted-by":"crossref","first-page":"023037","DOI":"10.1088\/1367-2630\/17\/2\/023037","article-title":"A magic state\u2019s fidelity can be superior to the operations that created it","volume":"17","author":"Li Ying","year":"2015","unstructured":"Ying Li. 2015. A magic state\u2019s fidelity can be superior to the operations that created it. New Journal of Physics 17, 2 (2015), 023037.","journal-title":"New Journal of Physics"},{"key":"e_1_3_3_64_2","first-page":"1343","volume-title":"Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Lin Maokai","year":"2014","unstructured":"Maokai Lin and Patrick Jaillet. 2014. On the quickest flow problem in dynamic networks \u2013 A parametric min-cost flow approach. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1343\u20131356."},{"issue":"13","key":"e_1_3_3_65_2","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1073\/pnas.1618020114","article-title":"Experimental comparison of two quantum computing architectures","volume":"114","author":"Linke Norbert M.","year":"2017","unstructured":"Norbert M. Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A. Landsman, Kenneth Wright, and Christopher Monroe. 2017. Experimental comparison of two quantum computing architectures. Proceedings of the National Academy of Sciences 114, 13 (2017), 3305\u20133310.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.22331\/q-2019-03-05-128","article-title":"A game of surface codes: Large-scale quantum computing with lattice surgery","volume":"3","author":"Litinski Daniel","year":"2019","unstructured":"Daniel Litinski. 2019. A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum 3 (2019), 128.","journal-title":"Quantum"},{"key":"e_1_3_3_67_2","volume-title":"American Physical Society (March Meeting)","author":"Liu Yehan","year":"2022","unstructured":"Yehan Liu, Zlatko Minev, Thomas G. McConkey, and Jay Gambetta. 2022. Design of interacting superconducting quantum circuits with quasi-lumped models. In American Physical Society (March Meeting)."},{"issue":"2","key":"e_1_3_3_68_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3505181","article-title":"Best approximate quantum compiling problems","volume":"3","author":"Madden Liam","year":"2022","unstructured":"Liam Madden and Andrea Simonetto. 2022. Best approximate quantum compiling problems. ACM Transactions on Quantum Computing 3, 2 (2022), 1\u201329.","journal-title":"ACM Transactions on Quantum Computing"},{"key":"e_1_3_3_69_2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-030-89746-8_2","volume-title":"Quantum Computing Environments","author":"Maronese Marco","year":"2022","unstructured":"Marco Maronese, Lorenzo Moro, Lorenzo Rocutto, and Enrico Prati. 2022. Quantum compiling. In Quantum Computing Environments. Springer, 39\u201374."},{"key":"e_1_3_3_70_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-642-02017-9_32","volume-title":"International Conference on Theory and Applications of Models of Computation","author":"Martens Maren","year":"2009","unstructured":"Maren Martens. 2009. A simple greedy algorithm for the k-disjoint flow problem. In International Conference on Theory and Applications of Models of Computation. Springer, 291\u2013300."},{"issue":"4","key":"e_1_3_3_71_2","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/TCAD.2008.917562","article-title":"Quantum circuit placement","volume":"27","author":"Maslov Dmitri","year":"2008","unstructured":"Dmitri Maslov, Sean M. Falconer, and Michele Mosca. 2008. Quantum circuit placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 4 (2008), 752\u2013763.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"7","key":"e_1_3_3_72_2","doi-asserted-by":"crossref","first-page":"4729","DOI":"10.1109\/TIT.2018.2825602","article-title":"Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations","volume":"64","author":"Maslov Dmitri","year":"2018","unstructured":"Dmitri Maslov and Martin Roetteler. 2018. Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations. IEEE Transactions on Information Theory 64, 7 (2018), 4729\u20134738.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_3_73_2","volume-title":"R2021b","year":"2021","unstructured":"MATLAB. 2021. R2021b. The MathWorks Inc., Natick, Massachusetts."},{"issue":"2","key":"e_1_3_3_74_2","doi-asserted-by":"crossref","first-page":"022317","DOI":"10.1103\/PhysRevA.89.022317","article-title":"Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects","volume":"89","author":"Monroe C.","year":"2014","unstructured":"C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L.-M. Duan, and J. Kim. 2014. Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects. Physical Review A 89, 2 (2014), 022317.","journal-title":"Physical Review A"},{"issue":"178","key":"e_1_3_3_75_2","article-title":"Quantum compiling by deep reinforcement learning","volume":"4","author":"Moro Lorenzo","year":"2021","unstructured":"Lorenzo Moro, Matteo G. A. Paris, Marcello Restelli, and Enrico Prati. 2021. Quantum compiling by deep reinforcement learning. Nature Communications Physics 4, 178 (2021).","journal-title":"Nature Communications Physics"},{"key":"e_1_3_3_76_2","doi-asserted-by":"crossref","unstructured":"Michael A. Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information. (2002).","DOI":"10.1119\/1.1463744"},{"issue":"3","key":"e_1_3_3_77_2","doi-asserted-by":"crossref","first-page":"035102","DOI":"10.1088\/1402-4896\/abd57c","article-title":"Automated window-based partitioning of quantum circuits","volume":"96","author":"Nikahd Eesa","year":"2021","unstructured":"Eesa Nikahd, Naser Mohammadzadeh, Mehdi Sedighi, and Morteza Saheb Zamani. 2021. Automated window-based partitioning of quantum circuits. Physica Scripta 96, 3 (2021), 035102.","journal-title":"Physica Scripta"},{"issue":"1","key":"e_1_3_3_78_2","first-page":"1","article-title":"Routing entanglement in the quantum internet","volume":"5","author":"Pant Mihir","year":"2019","unstructured":"Mihir Pant, Hari Krovi, Don Towsley, Leandros Tassiulas, Liang Jiang, Prithwish Basu, Dirk Englund, and Saikat Guha. 2019. Routing entanglement in the quantum internet. npj Quantum Information 5, 1 (2019), 1\u20139.","journal-title":"npj Quantum Information"},{"issue":"7598","key":"e_1_3_3_79_2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1038\/532169a","article-title":"Physics: Unite to build a quantum Internet","volume":"532","author":"Pirandola Stefano","year":"2016","unstructured":"Stefano Pirandola and Samuel L. Braunstein. 2016. Physics: Unite to build a quantum Internet. Nature News 532, 7598 (2016), 169.","journal-title":"Nature News"},{"issue":"1","key":"e_1_3_3_80_2","first-page":"1","article-title":"Designing quantum networks using preexisting infrastructure","volume":"8","author":"Rabbie Julian","year":"2022","unstructured":"Julian Rabbie, Kaushik Chakraborty, Guus Avis, and Stephanie Wehner. 2022. Designing quantum networks using preexisting infrastructure. npj Quantum Information 8, 1 (2022), 1\u201312.","journal-title":"npj Quantum Information"},{"key":"e_1_3_3_81_2","doi-asserted-by":"crossref","first-page":"107419","DOI":"10.1016\/j.knosys.2021.107419","article-title":"A novel approach based on genetic algorithm to speed up the discovery of classification rules on GPUs","volume":"231","author":"Roui Mohammad Beheshti","year":"2021","unstructured":"Mohammad Beheshti Roui, Mariam Zomorodi, Masoomeh Sarvelayati, Moloud Abdar, Hamid Noori, Pawe\u0142 P\u0142awiak, Ryszard Tadeusiewicz, Xujuan Zhou, Abbas Khosravi, Saeid Nahavandi, et al. 2021. A novel approach based on genetic algorithm to speed up the discovery of classification rules on GPUs. Knowledge-Based Systems 231 (2021), 107419.","journal-title":"Knowledge-Based Systems"},{"issue":"8","key":"e_1_3_3_82_2","first-page":"1","article-title":"A general protocol for distributed quantum gates","volume":"20","author":"Sarvaghad-Moghaddam Moein","year":"2021","unstructured":"Moein Sarvaghad-Moghaddam and Mariam Zomorodi. 2021. A general protocol for distributed quantum gates. Quantum Information Processing 20, 8 (2021), 1\u201314.","journal-title":"Quantum Information Processing"},{"issue":"4","key":"e_1_3_3_83_2","doi-asserted-by":"crossref","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","article-title":"Quantum circuits of T-depth one","volume":"87","author":"Selinger Peter","year":"2013","unstructured":"Peter Selinger. 2013. Quantum circuits of T-depth one. Physical Review A 87, 4 (2013), 042302.","journal-title":"Physical Review A"},{"key":"e_1_3_3_84_2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/3168822","volume-title":"Proceedings of the 2018 International Symposium on Code Generation and Optimization","author":"Siraichi Marcos Yukio","year":"2018","unstructured":"Marcos Yukio Siraichi, Vin\u00edcius Fernandes dos Santos, Sylvain Collange, and Fernando Magno Quint\u00e3o Pereira. 2018. Qubit allocation. In Proceedings of the 2018 International Symposium on Code Generation and Optimization. 113\u2013125."},{"key":"e_1_3_3_85_2","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1109\/SFCS.1997.646130","volume-title":"Proceedings 38th Annual Symposium on Foundations of Computer Science","author":"Srinivasan Aravind","year":"1997","unstructured":"Aravind Srinivasan. 1997. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings 38th Annual Symposium on Foundations of Computer Science. IEEE, 416\u2013425."},{"issue":"1","key":"e_1_3_3_86_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0166-218X(99)00133-X","article-title":"On complexity, representation and approximation of integral multicommodity flows","volume":"99","author":"Srivastav Anand","year":"2000","unstructured":"Anand Srivastav and Peter Stangier. 2000. On complexity, representation and approximation of integral multicommodity flows. Discrete Applied Mathematics 99, 1-3 (2000), 183\u2013208.","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"e_1_3_3_87_2","doi-asserted-by":"crossref","first-page":"110501","DOI":"10.1103\/PhysRevLett.124.110501","article-title":"High-rate, high-fidelity entanglement of qubits across an elementary quantum network","volume":"124","author":"Stephenson L. J.","year":"2020","unstructured":"L. J. Stephenson, D. P. Nadlinger, B. C. Nichol, S. An, P. Drmota, T. G. Ballance, K. Thirumalai, J. F. Goodwin, D. M. Lucas, and C. J. Ballance. 2020. High-rate, high-fidelity entanglement of qubits across an elementary quantum network. Physical Review Letters 124, 11 (2020), 110501.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_88_2","article-title":"ZX-calculus for the working quantum computer scientist","author":"Wetering John van de","year":"2020","unstructured":"John van de Wetering. 2020. ZX-calculus for the working quantum computer scientist. arXiv preprint arXiv:2012.13966 (2020).","journal-title":"arXiv preprint arXiv:2012.13966"},{"issue":"9","key":"e_1_3_3_89_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/MC.2016.291","article-title":"The path to scalable distributed quantum computing","volume":"49","author":"Van Meter Rodney","year":"2016","unstructured":"Rodney Van Meter and Simon J. Devitt. 2016. The path to scalable distributed quantum computing. Computer 49, 9 (2016), 31\u201342.","journal-title":"Computer"},{"issue":"1","key":"e_1_3_3_90_2","first-page":"1","article-title":"Single ion qubit with estimated coherence time exceeding one hour","volume":"12","author":"Wang Pengfei","year":"2021","unstructured":"Pengfei Wang, Chun-Yang Luan, Mu Qiao, Mark Um, Junhua Zhang, Ye Wang, Xiao Yuan, Mile Gu, Jingning Zhang, and Kihwan Kim. 2021. Single ion qubit with estimated coherence time exceeding one hour. Nature Communications 12, 1 (2021), 1\u20138.","journal-title":"Nature Communications"},{"issue":"6412","key":"e_1_3_3_91_2","article-title":"Quantum internet: A vision for the road ahead","volume":"362","author":"Wehner Stephanie","year":"2018","unstructured":"Stephanie Wehner, David Elkouss, and Ronald Hanson. 2018. Quantum internet: A vision for the road ahead. Science 362, 6412 (2018).","journal-title":"Science"},{"key":"e_1_3_3_92_2","first-page":"1","volume-title":"2019 56th ACM\/IEEE Design Automation Conference","author":"Wille Robert","year":"2019","unstructured":"Robert Wille, Lukas Burgholzer, and Alwin Zulehner. 2019. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In 2019 56th ACM\/IEEE Design Automation Conference. IEEE, 1\u20136."},{"issue":"2225","key":"e_1_3_3_93_2","doi-asserted-by":"crossref","first-page":"20180427","DOI":"10.1098\/rspa.2018.0427","article-title":"Quantum advantage of unitary Clifford circuits with magic state inputs","volume":"475","author":"Yoganathan Mithuna","year":"2019","unstructured":"Mithuna Yoganathan, Richard Jozsa, and Sergii Strelchuk. 2019. Quantum advantage of unitary Clifford circuits with magic state inputs. Proceedings of the Royal Society A 475, 2225 (2019), 20180427.","journal-title":"Proceedings of the Royal Society A"},{"issue":"17","key":"e_1_3_3_94_2","doi-asserted-by":"crossref","first-page":"170501","DOI":"10.1103\/PhysRevLett.125.170501","article-title":"Topological quantum compiling with reinforcement learning","volume":"125","author":"Zhang Yuan-Hang","year":"2020","unstructured":"Yuan-Hang Zhang, Pei-Lin Zheng, Yi Zhang, and Dong-Ling Deng. 2020. Topological quantum compiling with reinforcement learning. Physical Review Letters 125, 17 (2020), 170501.","journal-title":"Physical Review Letters"},{"issue":"1","key":"e_1_3_3_95_2","doi-asserted-by":"crossref","first-page":"010511","DOI":"10.1103\/PhysRevLett.124.010511","article-title":"Proposal for heralded generation and detection of entangled microwave\u2013optical-photon pairs","volume":"124","author":"Zhong Changchun","year":"2020","unstructured":"Changchun Zhong, Zhixin Wang, Changling Zou, Mengzhen Zhang, Xu Han, Wei Fu, Mingrui Xu, S. Shankar, Michel H. Devoret, Hong X. Tang, et al. 2020. Proposal for heralded generation and detection of entangled microwave\u2013optical-photon pairs. Physical Review Letters 124, 1 (2020), 010511.","journal-title":"Physical Review Letters"},{"issue":"5","key":"e_1_3_3_96_2","doi-asserted-by":"crossref","first-page":"052316","DOI":"10.1103\/PhysRevA.62.052316","article-title":"Methodology for quantum logic gate construction","volume":"62","author":"Zhou Xinlan","year":"2000","unstructured":"Xinlan Zhou, Debbie W. Leung, and Isaac L. Chuang. 2000. Methodology for quantum logic gate construction. Physical Review A 62, 5 (2000), 052316.","journal-title":"Physical Review A"},{"key":"e_1_3_3_97_2","article-title":"Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization","volume":"20","author":"Zomorodi-Moghadam Mariam","year":"2021","unstructured":"Mariam Zomorodi-Moghadam, Zohreh Davarzani, Ismail Ghodsollahee, et al. 2021. Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization. Quantum Information Processing 20 (2021).","journal-title":"Quantum Information Processing"},{"issue":"3","key":"e_1_3_3_98_2","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1007\/s10773-017-3618-x","article-title":"Optimizing teleportation cost in distributed quantum circuits","volume":"57","author":"Zomorodi-Moghadam Mariam","year":"2018","unstructured":"Mariam Zomorodi-Moghadam, Mahboobeh Houshmand, and Monireh Houshmand. 2018. Optimizing teleportation cost in distributed quantum circuits. International Journal of Theoretical Physics 57, 3 (2018), 848\u2013861.","journal-title":"International Journal of Theoretical Physics"},{"key":"e_1_3_3_99_2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/3287624.3287704","volume-title":"Proceedings of the 24th Asia and South Pacific Design Automation Conference","author":"Zulehner Alwin","year":"2019","unstructured":"Alwin Zulehner and Robert Wille. 2019. Compiling \\(SU(4)\\) quantum circuits to IBM QX architectures. In Proceedings of the 24th Asia and South Pacific Design Automation Conference. 185\u2013190."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:27Z","timestamp":1750182567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,24]]},"references-count":98,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,30]]}},"alternative-id":["10.1145\/3579367"],"URL":"https:\/\/doi.org\/10.1145\/3579367","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,24]]},"assertion":[{"value":"2021-12-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}