{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:06:29Z","timestamp":1768871189047,"version":"3.49.0"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T00:00:00Z","timestamp":1755302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100005046","name":"Natural Science Foundation of Heilongjiang Province of China","doi-asserted-by":"crossref","award":["LH2024F042"],"award-info":[{"award-number":["LH2024F042"]}],"id":[{"id":"10.13039\/501100005046","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,13]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In the Noisy Intermediate-Scale Quantum (NISQ) era, owing to the limitation of quantum hardware coupling constraints, only physically directly connected qubits can realize interaction. For CNOT gates that do not satisfy the coupling conditions, extra SWAP gates need to be inserted to adjust the qubit positions to ensure the executability of the quantum circuit. To reduce the extra overhead due to SWAP gates, this paper proposes a Leveraging Strategy-Driven Quantum Sparrow Search Algorithm (LS-QSSA) and applies it to quantum circuit mapping. LS-QSSA introduces the concept of qubit coupling count, and combines it with the SWAP gate overhead to jointly construct the fitness function. In the individual selection stage, the top 20% of individuals in terms of fitness value are set as \u201cdiscoverers,\u201d which are able to explore multiple solution space locations at the same time through the introduction of quantum representations, thus expanding the search space. To enhance the capability of escaping local optima, LS-QSSA introduces a Gaussian noise mechanism to perturb the follower positions. Experimental results demonstrate that LS-QSSA achieves an approximate reduction of 36.4% and 47.5% in the quantity of SWAP gates, and around 13.1% and 13.2% in hardware gate count overhead, when compared with the $t\\ket{ket}$ and Qiskit compilers, respectively.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf098","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:46:42Z","timestamp":1753357602000},"page":"50-62","source":"Crossref","is-referenced-by-count":0,"title":["An optimized sparrow search algorithm for quantum circuit mapping"],"prefix":"10.1093","volume":"69","author":[{"given":"Hui","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer and Information Engineering , Harbin University of Commerce, No. 1 Xuehai Street, Songbei District, Harbin 150028 ,","place":["China"]},{"name":"Heilongjiang Provincial Key Laboratory of Electronic Commerce and Information Processing , Harbin University of Commerce, No. 1 Xuehai Street, Songbei District, Harbin 150028 ,","place":["China"]}]},{"given":"Shujuan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering , Harbin University of Commerce, No. 1 Xuehai Street, Songbei District, Harbin 150028 ,","place":["China"]}]},{"given":"Jiepeng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering , Harbin University of Commerce, No. 1 Xuehai Street, Songbei District, Harbin 150028 ,","place":["China"]}]},{"given":"Yingsong","family":"Ji","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering , Harbin University of Commerce, No. 1 Xuehai Street, Songbei District, Harbin 150028 ,","place":["China"]}]},{"given":"Yingchen","family":"Ma","sequence":"additional","affiliation":[{"name":"College of Intelligent Engineering , Harbin Institute of Petroleum, No. 297 Songpu Road, Songbei District, Harbin 150028 ,","place":["China"]}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8084-2956","authenticated-orcid":false,"given":"Yutong","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Information and Electronics , Beijing Institute of Technology, No. 5 Zhongguancun South Street, Haidian District, Beijing 100081 ,","place":["China"]}]}],"member":"286","published-online":{"date-parts":[[2025,8,16]]},"reference":[{"key":"2026011907114217500_ref1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-69318-3_13","article-title":"Shor algorithm","author":"LaPierre","year":"2021","journal-title":"Introduction to Quantum Computing"},{"key":"2026011907114217500_ref2","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1109\/BigData.2018.8622457","article-title":"Implementing Grover\u2019s algorithm on the IBM quantum computers","volume-title":"Proceedings of the 2018 IEEE International Conference on Big Data (BD)","author":"Mandviwalla","year":"2018"},{"key":"2026011907114217500_ref3","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.jacc.2018.08.2166","article-title":"Cardiorespiratory fitness and mortality in healthy men and women","volume":"72","author":"Imboden","year":"2018","journal-title":"J Am Coll Cardiol"},{"key":"2026011907114217500_ref4","first-page":"9","article-title":"A survey of NISQ era hybrid quantum-classical machine learning research","volume":"2","author":"De Luca","year":"2022","journal-title":"J Artif Intell Technol"},{"key":"2026011907114217500_ref5","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1587\/transfun.2022EAP1159","article-title":"A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates","volume":"E106.A","author":"Matsuo","year":"2023","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"2026011907114217500_ref6","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/TCAD.2021.3112143","article-title":"An iterated local search methodology for the qubit mapping problem","volume":"41","author":"Zhu","year":"2021","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"2026011907114217500_ref7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00354-022-00163-5","article-title":"Mapping quantum circuits in IBM Q devices using progressive qubit assignment for global ordering","volume":"40","author":"Chhangte","year":"2022","journal-title":"New Gener Comput"},{"key":"2026011907114217500_ref8","first-page":"167","article-title":"QuCloud: a new qubit mapping mechanism for multi-programming quantum computing in cloud environment","volume-title":"Proceedings of the 27th IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Liu","year":"2021"},{"key":"2026011907114217500_ref9","first-page":"1","article-title":"QURE: qubit re-allocation in noisy intermediate-scale quantum computers","volume-title":"Proceedings of the 56th Annual Design Automation Conference (DAC)","author":"Ash-Saki","year":"2019"},{"key":"2026011907114217500_ref10","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2023.0141217","article-title":"Research on qubit mapping technique based on batch SWAP optimization","volume":"14","author":"Li","year":"2023","journal-title":"Int J Adv Comput Sci Appl"},{"key":"2026011907114217500_ref11","first-page":"198","article-title":"MQT QMAP: efficient quantum circuit mapping","volume-title":"Proceedings of the 32nd International Symposium on Physical Design (ISPD)","author":"Wille","year":"2023"},{"key":"2026011907114217500_ref12","doi-asserted-by":"publisher","first-page":"13118","DOI":"10.1038\/s41598-024-64061-0","article-title":"QM-DLA: an efficient qubit mapping method based on dynamic look-ahead strategy","volume":"14","author":"Liu","year":"2024","journal-title":"Sci Rep"},{"key":"2026011907114217500_ref13","first-page":"1","article-title":"A robust quantum layout synthesis algorithm with a qubit mapping checker","volume-title":"Proceedings of the 41st IEEE\/ACM International Conference on Computer-Aided Design(ICCAD)","author":"Wu","year":"2022"},{"key":"2026011907114217500_ref14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3593594","article-title":"On optimal subarchitectures for quantum circuit mapping","volume":"4","author":"Peham","year":"2023","journal-title":"ACM Trans Quantum Comput"},{"key":"2026011907114217500_ref15","doi-asserted-by":"publisher","first-page":"4721","DOI":"10.1109\/TCAD.2020.2970594","article-title":"A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers","volume":"39","author":"Zhu","year":"2020","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"2026011907114217500_ref16","doi-asserted-by":"publisher","first-page":"4683","DOI":"10.1109\/TCAD.2020.2969647","article-title":"Quantum circuit transformation based on simulated annealing and heuristic search","volume":"39","author":"Zhou","year":"2020","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"2026011907114217500_ref17","first-page":"570","article-title":"SQUARE: strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation","volume-title":"Proceedings of the 47th ACM\/IEEE International Symposium on Computer Architecture (ISCA)","author":"Ding","year":"2020"},{"key":"2026011907114217500_ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-72904-2_1","article-title":"A novel ant colony optimization strategy for the quantum circuit compilation problem","volume-title":"Proceedings of the 21st European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP)","author":"Baioletti","year":"2021"},{"key":"2026011907114217500_ref19","first-page":"113","article-title":"Qubit allocation","volume-title":"Proceedings of the 16th International Symposium on Code Generation and Optimization (CGO).","author":"Siraichi","year":"2018"},{"key":"2026011907114217500_ref20","article-title":"GA4QCO: genetic algorithm for quantum circuit optimization.","author":"S\u00fcnkel","year":"2023"},{"key":"2026011907114217500_ref21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3160015","article-title":"Topological-graph dependencies and scaling properties of a heuristic qubit-assignment algorithm","volume":"3","author":"Steinberg","year":"2022","journal-title":"IEEE Trans Quantum Eng"},{"key":"2026011907114217500_ref22","first-page":"351","article-title":"2QAN: A quantum compiler for 2-local qubit hamiltonian simulation algorithms","volume-title":"Proceedings of the 49th International Symposium on Computer Architecture (ISCA)","author":"Lao","year":"2022"},{"key":"2026011907114217500_ref23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3026544","article-title":"A hardware-aware heuristic for the qubit mapping problem in the NISQ era","volume":"1","author":"Niu","year":"2020","journal-title":"IEEE Trans Quantum Eng"},{"key":"2026011907114217500_ref24","doi-asserted-by":"publisher","first-page":"014003","DOI":"10.1088\/2058-9565\/ab8e92","volume":"6","author":"Sivarajah","year":"2020","journal-title":"Quantum Sci Technol"},{"key":"2026011907114217500_ref25","first-page":"2144","article-title":"Analyzing quantum programs with LintQ: a static analysis framework for Qiskit","volume-title":"Proceedings of the 1st ACM International Conference on Software Engineering (FSE)","author":"Paltenghi","year":"2024"},{"key":"2026011907114217500_ref26","first-page":"1001","article-title":"Tackling the qubit mapping problem for NISQ-era quantum devices","volume-title":"Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)","author":"Li","year":"2019"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/50\/64068201\/bxaf098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/50\/64068201\/bxaf098.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:11:51Z","timestamp":1768824711000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/1\/50\/8236520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,16]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,8,16]]},"published-print":{"date-parts":[[2026,1,13]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf098","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,1]]},"published":{"date-parts":[[2025,8,16]]}}}