{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:20:37Z","timestamp":1784640037602,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T00:00:00Z","timestamp":1679788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union Horizon 2020","award":["101001318"],"award-info":[{"award-number":["101001318"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,3,26]]},"DOI":"10.1145\/3569052.3578928","type":"proceedings-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T17:51:55Z","timestamp":1679507515000},"page":"198-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["MQT QMAP"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-7860","authenticated-orcid":false,"given":"Robert","family":"Wille","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4699-1316","authenticated-orcid":false,"given":"Lukas","family":"Burgholzer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_1_2_1","volume-title":"Comput.","author":"Shor Peter W.","year":"1997","unstructured":"Peter W. Shor, ?Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,\" SIAM J. Comput., 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3049230"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3390\/e12112268"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2018.2888987"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010339"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361--6633"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--99498--7_16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--36315--3_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2019.10.004"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Sarah Schneider Lukas Burgholzer and Robert Wille \"A SAT encoding for optimal Clifford circuit synthesis \" in Asia and South Pacific Design Automation Conf. 2023.","DOI":"10.1145\/3566097.3567929"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.010301"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2011.54"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE49297.2020.00036"},{"key":"e_1_3_2_1_19_1","volume-title":"Variational quantum algorithms","author":"M. Cerezo","year":"2020","unstructured":"M. Cerezo et al., Variational quantum algorithms, 2020. arXiv: 2012.09265."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.5089550"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2008.09.003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-09-21-327"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphoton.2009.229"},{"key":"e_1_3_2_1_24_1","volume-title":"Search","author":"Botea A.","year":"2018","unstructured":"A. Botea, A. Kishimoto, and Radu Marinescu, \"On the complexity of quantum circuit compilation,\" in Intl Symp Comb. Search, 2018."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Robert Wille Lukas Burgholzer and Alwin Zulehner \"Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations \" in Design Automation Conf. 2019.","DOI":"10.1145\/3316781.3317859"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Lukas Burgholzer Sarah Schneider and Robert Wille \"Limiting the search space in optimal quantum circuit mapping \" in Asia and South Pacific Design Automation Conf. 2022.","DOI":"10.1109\/ASP-DAC52403.2022.9712555"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394885.3431604"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287704"},{"key":"e_1_3_2_1_30_1","first-page":"337","volume-title":"An efficient SMT solver,\" in Tools Algorithms Constr. Anal. Syst","author":"de Moura Leonardo","year":"2008","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner, \"Z3: An efficient SMT solver,\" in Tools Algorithms Constr. Anal. Syst., Springer, 2008, pp. 337--340."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_32_1","volume-title":"Zenodo","author":"Matthew","year":"2022","unstructured":"Matthew Treinish et al., Qiskit\/qiskit, Zenodo, 2022. doi: 10. 5281\/ZENODO.2573505."},{"key":"e_1_3_2_1_33_1","volume-title":"OpenQASM 3: A broader and deeper quantum assembly language","author":"Andrew","year":"2021","unstructured":"Andrew W. Cross et al., OpenQASM 3: A broader and deeper quantum assembly language, 2021. arXiv: 2104.14722."},{"key":"e_1_3_2_1_34_1","volume-title":"MQT Bench: Benchmarking software and design automation tools for quantum computing","author":"Quetschlich Nils","year":"2022","unstructured":"Nils Quetschlich, Lukas Burgholzer, and Robert Wille, MQT Bench: Benchmarking software and design automation tools for quantum computing, 2022. arXiv: 2204.13719."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14082-3_18"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565"},{"key":"e_1_3_2_1_37_1","volume-title":"On Optimal Subarchitectures for Quantum Circuit Mapping","author":"Peham Tom","year":"2022","unstructured":"Tom Peham, Lukas Burgholzer, and Robert Wille, On Optimal Subarchitectures for Quantum Circuit Mapping, 2022. arXiv: 2210.09321 [quant-ph]."}],"event":{"name":"ISPD '23: International Symposium on Physical Design","location":"Virtual Event USA","acronym":"ISPD '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2023 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569052.3578928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569052.3578928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:41Z","timestamp":1750182701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569052.3578928"}},"subtitle":["Efficient Quantum Circuit Mapping"],"short-title":[],"issued":{"date-parts":[[2023,3,26]]},"references-count":37,"alternative-id":["10.1145\/3569052.3578928","10.1145\/3569052"],"URL":"https:\/\/doi.org\/10.1145\/3569052.3578928","relation":{},"subject":[],"published":{"date-parts":[[2023,3,26]]},"assertion":[{"value":"2023-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}