{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:11Z","timestamp":1772119871993,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11227-023-05848-2","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T09:02:15Z","timestamp":1703062935000},"page":"10172-10189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BQA: a high-performance quantum circuits scheduling strategy based on heuristic search"],"prefix":"10.1007","volume":"80","author":[{"given":"Xin-miao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-jin","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-zheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"5848_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman RP (1982) Simulating physics with computers. Int J Theor Phys 21:467\u2013488. https:\/\/doi.org\/10.1007\/BF02650179","journal-title":"Int J Theor Phys"},{"key":"5848_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/spe.3039","volume":"52","author":"SS Gill","year":"2022","unstructured":"Gill SS, Kumar A, Singh H, Singh M, Kaur K, Usman M, Buyya R (2022) Quantum computing: a taxonomy, systematic review and future directions. Softw: Pract Exp 52:66\u2013114. https:\/\/doi.org\/10.1002\/spe.3039","journal-title":"Softw: Pract Exp"},{"key":"5848_CR3","doi-asserted-by":"publisher","unstructured":"Fedorov AK, Gisin N, Beloussov SM, Lvovsky AI (2022) Quantum computing at the quantum advantage threshold: a down-to-business review. arXiv:2203.17181https:\/\/doi.org\/10.48550\/arXiv.2203.17181","DOI":"10.48550\/arXiv.2203.17181"},{"key":"5848_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3030314","volume":"1","author":"DJ Egger","year":"2020","unstructured":"Egger DJ, Gambella C, Marecek J, McFaddin S, Mevissen M, Raymond R, Simonetto A, Woerner S, Yndurain E (2020) Quantum computing for finance: state-of-the-art and future prospects. IEEE Trans Quant Eng 1:1\u201324. https:\/\/doi.org\/10.1109\/TQE.2020.3030314","journal-title":"IEEE Trans Quant Eng"},{"key":"5848_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte J, Wittek P, Pancotti N, Rebentrost P, Wiebe N, Lloyd S (2017) Quantum machine learning. Nature 549:195\u2013202. https:\/\/doi.org\/10.1038\/nature23474","journal-title":"Nature"},{"key":"5848_CR6","doi-asserted-by":"publisher","first-page":"10856","DOI":"10.1021\/acs.chemrev.8b00803","volume":"119","author":"Y Cao","year":"2019","unstructured":"Cao Y, Romero J, Olson JP, Degroote M, Johnson PD, Kieferov\u00e1 M, Kivlichan ID, Menke T, Peropadre B, Sawaya NPD, Sim S, Veis L, Aspuru-Guzik A (2019) Quantum chemistry in the age of quantum computing. Chem Rev 119:10856\u201310915. https:\/\/doi.org\/10.1021\/acs.chemrev.8b00803","journal-title":"Chem Rev"},{"key":"5848_CR7","doi-asserted-by":"publisher","unstructured":"Clarke SJ (2020) Quantum computing: a mathematical analysis of shor\u2019s algorithm. arXiv:1601.07195https:\/\/doi.org\/10.48550\/arXiv.1601.07195","DOI":"10.48550\/arXiv.1601.07195"},{"key":"5848_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.revip.2019.100028","volume":"4","author":"R Or\u00fas","year":"2019","unstructured":"Or\u00fas R, Mugel S, Lizaso E (2019) Quantum computing for finance: overview and prospects. Rev Phys 4:100028. https:\/\/doi.org\/10.1016\/j.revip.2019.100028","journal-title":"Rev Phys"},{"key":"5848_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.5815\/ijmsc.2016.01.02","volume":"2","author":"M Rahaman","year":"2016","unstructured":"Rahaman M, Islam MM (2016) An overview on quantum computing as a service (qcaas): probability or possibility. Int J Math Sci Comput (IJMSC) 2:16\u201322. https:\/\/doi.org\/10.5815\/ijmsc.2016.01.02","journal-title":"Int J Math Sci Comput (IJMSC)"},{"key":"5848_CR10","doi-asserted-by":"publisher","unstructured":"Aleksandrowicz G, Alexander T, Barkoutsos P, Bello L et al (2019) Qiskit: an Open-source Framework for Quantum Computing. Qiskit Res Commun. https:\/\/doi.org\/10.5281\/zenodo.2562111","DOI":"10.5281\/zenodo.2562111"},{"key":"5848_CR11","doi-asserted-by":"publisher","unstructured":"Cirq Developers (2021) Cirq. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.6599601. See full list of authors on Github: https:\/\/github.com\/quantumlib\/Cirq\/graphs\/contributors","DOI":"10.5281\/zenodo.6599601"},{"key":"5848_CR12","doi-asserted-by":"publisher","unstructured":"Smelyanskiy M, Sawaya NPD, Aspuru-Guzik A (2016) qhipster: The quantum high performance software testing environment. arXiv:1601.07195https:\/\/doi.org\/10.48550\/arXiv.1601.07195","DOI":"10.48550\/arXiv.1601.07195"},{"key":"5848_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3026544","volume":"1","author":"S Niu","year":"2020","unstructured":"Niu S, Suau A, Staffelbach G, Todri-Sanial A (2020) A hardware-aware heuristic for the qubit mapping problem in the nisq era. IEEE Trans Quant Eng 1:1\u201314. https:\/\/doi.org\/10.1109\/TQE.2020.3026544","journal-title":"IEEE Trans Quant Eng"},{"key":"5848_CR14","doi-asserted-by":"publisher","unstructured":"Matsuo A, Hattori W, Yamashita S (2019) Reducing the overhead of mapping quantum circuits to ibm q system. In: 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp 1\u20135. https:\/\/doi.org\/10.1109\/ISCAS.2019.8702439","DOI":"10.1109\/ISCAS.2019.8702439"},{"key":"5848_CR15","doi-asserted-by":"publisher","unstructured":"Siraichi MY, Santos VFd, Collange C, Pereira FMQ (2018) Qubit allocation. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp 113\u2013125. https:\/\/doi.org\/10.1145\/3168822","DOI":"10.1145\/3168822"},{"key":"5848_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1038\/nature15263","volume":"526","author":"M Veldhorst","year":"2015","unstructured":"Veldhorst M, Yang C, Hwang J, Huang W, Dehollain J, Muhonen J, Simmons S, Laucht A, Hudson F, Itoh KM et al (2015) A two-qubit logic gate in silicon. Nature 526:410\u2013414. https:\/\/doi.org\/10.1038\/nature15263","journal-title":"Nature"},{"key":"5848_CR17","doi-asserted-by":"publisher","unstructured":"Wille R, Keszocze O, Walter M, Rohrs P, Chattopadhyay A, Drechsler R (2016) Look-Ahead Schemes for Nearest Neighbor Optimization of 1d and 2d Quantum Circuits. In: 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 292\u2013297. https:\/\/doi.org\/10.1109\/ASPDAC.2016.7428026","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"5848_CR18","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/JETCAS.2016.2528720","volume":"6","author":"A Kole","year":"2016","unstructured":"Kole A, Datta K, Sengupta I (2016) A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using $$n$$-gate lookahead. IEEE J merg Select Top Circ Syst 6:62\u201372. https:\/\/doi.org\/10.1109\/JETCAS.2016.2528720","journal-title":"IEEE J merg Select Top Circ Syst"},{"key":"5848_CR19","unstructured":"Cowtan A, Dilkes S, Duncan R, Krajenbrink A, Simmons W, Sivarajah S (2019) On the qubit routing problem. arXiv preprint arXiv:1902.08091"},{"key":"5848_CR20","doi-asserted-by":"crossref","unstructured":"Molavi A, Xu A, Diges M, Pick L, Tannu S, Albarghouthi A (2022) Qubit mapping and routing via maxsat. In: 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp 1078\u20131091. IEEE","DOI":"10.1109\/MICRO56248.2022.00077"},{"issue":"03","key":"5848_CR21","doi-asserted-by":"publisher","first-page":"1250034","DOI":"10.1142\/S0219749912500347","volume":"10","author":"CM Wilmott","year":"2012","unstructured":"Wilmott CM, Wild PR (2012) On a generalized quantum swap gate. Int J Quant Inform 10(03):1250034. https:\/\/doi.org\/10.1142\/S0219749912500347","journal-title":"Int J Quant Inform"},{"issue":"1","key":"5848_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.4.010313","volume":"4","author":"A Bapat","year":"2023","unstructured":"Bapat A, Childs AM, Gorshkov AV, Schoute E (2023) Advantages and limitations of quantum routing. PRX Quant 4(1):010313","journal-title":"PRX Quant"},{"key":"5848_CR23","doi-asserted-by":"publisher","unstructured":"Li G, Ding Y, Xie Y (2019) Tackling the Qubit Mapping Problem for Nisq-Era Quantum Devices. In: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS \u201919, pp 1001\u20131014. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3297858.3304023","DOI":"10.1145\/3297858.3304023"},{"issue":"1","key":"5848_CR24","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92","volume":"6","author":"S Sivarajah","year":"2020","unstructured":"Sivarajah S, Dilkes S, Cowtan A, Simmons W, Edgington A, Duncan R (2020) t-ket>: a retargetable compiler for nisq devices. Quant Sci Technol 6(1):014003. https:\/\/doi.org\/10.1088\/2058-9565\/ab8e92","journal-title":"Quant Sci Technol"},{"key":"5848_CR25","doi-asserted-by":"publisher","unstructured":"Liu L, Dou X (2021) Qucloud: a new qubit mapping mechanism for multi-programming quantum computing in cloud environment. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp 167\u2013178. https:\/\/doi.org\/10.1109\/HPCA51647.2021.00024","DOI":"10.1109\/HPCA51647.2021.00024"},{"key":"5848_CR26","doi-asserted-by":"publisher","unstructured":"Wille R, Burgholzer L, Zulehner A (2019) Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations. In: Proceedings of the 56th Annual Design Automation Conference 2019, pp 1\u20136. https:\/\/doi.org\/10.1145\/3316781.3317859","DOI":"10.1145\/3316781.3317859"},{"key":"5848_CR27","doi-asserted-by":"publisher","unstructured":"Zhang C, Hayes AB, Qiu L, Jin Y, Chen Y, Zhang EZ (2021) Time-Optimal Qubit Mapping. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp 360\u2013374. https:\/\/doi.org\/10.1145\/3445814.3446706","DOI":"10.1145\/3445814.3446706"},{"key":"5848_CR28","doi-asserted-by":"publisher","unstructured":"Pozzi MG, Herbert SJ, Sengupta A, Mullins RD (2022) Using reinforcement learning to perform qubit routing in quantum compilers. ACM Trans Quant Comput. https:\/\/doi.org\/10.1145\/3520434","DOI":"10.1145\/3520434"},{"key":"5848_CR29","doi-asserted-by":"publisher","DOI":"10.1145\/3544563","author":"G Nannicini","year":"2022","unstructured":"Nannicini G, Bishop LS, G\u00fcnl\u00fck O, Jurcevic P (2022) Optimal qubit assignment and routing via integer programming. ACM Trans Quant Comput. https:\/\/doi.org\/10.1145\/3544563","journal-title":"ACM Trans Quant Comput"},{"key":"5848_CR30","doi-asserted-by":"publisher","unstructured":"Liu J, Li P, Zhou H (2022) Not all swaps have the same cost: A case for optimization-aware qubit routing. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp 709\u2013725. https:\/\/doi.org\/10.1109\/HPCA53966.2022.00058","DOI":"10.1109\/HPCA53966.2022.00058"},{"key":"5848_CR31","doi-asserted-by":"crossref","unstructured":"Banerjee A, Liang X, Tohid R (2022) Locality-aware qubit routing for the grid architecture. In: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp 607\u2013613. IEEE","DOI":"10.1109\/IPDPSW55747.2022.00103"},{"key":"5848_CR32","doi-asserted-by":"publisher","unstructured":"Lye A, Wille R, Drechsler R (2015) Determining the Minimal Number of Swap Gates for Multi-Dimensional Nearest Neighbor Quantum Circuits. In: The 20th Asia and South Pacific Design Automation Conference, pp 178\u2013183. https:\/\/doi.org\/10.1109\/ASPDAC.2015.7059001","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"5848_CR33","doi-asserted-by":"publisher","unstructured":"Nielsen MA, Chuang IL (2010) Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"key":"5848_CR34","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, Shor P, Sleator T, Smolin JA, Weinfurter H (1995) Elementary gates for quantum computation. Phys Rev A 52:3457\u20133467. https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys Rev A"},{"key":"5848_CR35","doi-asserted-by":"publisher","unstructured":"Williams CP (2011) Explorations in Quantum Computing. Springer. https:\/\/doi.org\/10.1007\/978-1-84628-887-6","DOI":"10.1007\/978-1-84628-887-6"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05848-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05848-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05848-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T09:39:52Z","timestamp":1713433192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05848-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,20]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["5848"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05848-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3166339\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,20]]},"assertion":[{"value":"26 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}