{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:20:48Z","timestamp":1757618448016,"version":"3.44.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Program for Quantum Science and Technology","award":["2021ZD0302901","2021ZD0302901","2021ZD0302901"],"award-info":[{"award-number":["2021ZD0302901","2021ZD0302901","2021ZD0302901"]}]},{"name":"Young Scientists Fund of the Natural Science Foundation of Jiangsu Province","award":["BK20240536"],"award-info":[{"award-number":["BK20240536"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["12471437"],"award-info":[{"award-number":["12471437"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04815-5","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T01:56:23Z","timestamp":1751421383000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Qubit mapping: the adaptive divide-and-conquer approach"],"prefix":"10.1007","volume":"24","author":[{"given":"Yunqi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangzhen","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanxu","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"issue":"6","key":"4815_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6), 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"issue":"1907","key":"4815_CR2","first-page":"553","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. Royal Soc. Lond. Ser. A Math. Phys. Sci. 439(1907), 553\u2013558 (1992)","journal-title":"Proc. Royal Soc. Lond. Ser. A Math. Phys. Sci."},{"key":"4815_CR3","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynominal time algorithms for discrete logarithms and factoring on a quantum computer. In: Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, p. 289 (1994). https:\/\/doi.org\/10.1007\/3-540-58691-1_68","DOI":"10.1007\/3-540-58691-1_68"},{"key":"4815_CR4","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual Symposium on Theory of Computing, pp. 212\u2013219. ACM, Philadelphia, Pennsylvania, USA, (1996)","DOI":"10.1145\/237814.237866"},{"issue":"15","key":"4815_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"4815_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"4815_CR7","unstructured":"Hsu, J.: Intel\u2019s 49-qubit chip shoots for quantum supremacy (2018). https:\/\/spectrum.ieee.org\/intels-49qubit-chip-aims-for-quantum-supremacy"},{"key":"4815_CR8","unstructured":"Kelly, J.: A preview of bristlecone, Google\u2019s new quantum processor. Google Research Blog 5 (2018)"},{"key":"4815_CR9","unstructured":"Gambetta, J.: Breaking the 1000-qubit barrier with Condor (2023). https:\/\/www.ibm.com\/quantum\/blog\/quantum-roadmap-2033"},{"key":"4815_CR10","doi-asserted-by":"publisher","unstructured":"Li, G., Ding, Y., Xie, Y.: Tackling the qubit mapping problem for NISQ-era quantum devices. In: Bahar, I., Herlihy, M., Witchel, E., Lebeck, A.R. (eds.) Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS, pp. 1001\u20131014. ACM, Providence, RI, USA (2019). https:\/\/doi.org\/10.1145\/3297858.3304023","DOI":"10.1145\/3297858.3304023"},{"key":"4815_CR11","doi-asserted-by":"crossref","unstructured":"Siraichi, M.Y., Santos, V.F.d., Collange, S., Pereira, F.M.Q.: Qubit allocation. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp. 113\u2013125. ACM (2018)","DOI":"10.1145\/3168822"},{"key":"4815_CR12","doi-asserted-by":"crossref","unstructured":"Wille, R., Burgholzer, L., Zulehner, A.: Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In: 2019 56th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136. IEEE (2019)","DOI":"10.1145\/3316781.3317859"},{"key":"4815_CR13","doi-asserted-by":"publisher","unstructured":"Shaik, I., Pol, J.: Optimal layout synthesis for quantum circuits as classical planning. In: IEEE\/ACM International Conference on Computer Aided Design, ICCAD, pp. 1\u20139. IEEE, San Francisco, CA, USA (2023). https:\/\/doi.org\/10.1109\/ICCAD57390.2023.10323924","DOI":"10.1109\/ICCAD57390.2023.10323924"},{"key":"4815_CR14","unstructured":"Almeida, A.A., Dueck, G.W., Silva, A.C.: Finding optimal qubit permutations for IBM\u2019s quantum computer architectures. In: Proceedings of the 32nd Symposium on Integrated Circuits and Systems Design, p. 13. ACM (2019)"},{"key":"4815_CR15","doi-asserted-by":"publisher","unstructured":"Tan, B., Cong, J.: Optimal layout synthesis for quantum computing. In: IEEE\/ACM International Conference On Computer Aided Design, ICCAD, pp. 137\u201311379. IEEE, San Diego, CA, USA (2020). https:\/\/doi.org\/10.1145\/3400302.3415620","DOI":"10.1145\/3400302.3415620"},{"issue":"7","key":"4815_CR16","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TCAD.2018.2846658","volume":"38","author":"A Zulehner","year":"2018","unstructured":"Zulehner, A., Paler, A., Wille, R.: An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(7), 1226\u20131236 (2018)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4815_CR17","unstructured":"Cross, A.: The IBM Q experience and QISKit open-source quantum computing software. In: APS March Meeting Abstracts, vol. 2018, pp. 58\u2013003 (2018)"},{"issue":"12","key":"4815_CR18","doi-asserted-by":"publisher","first-page":"4683","DOI":"10.1109\/TCAD.2020.2969647","volume":"39","author":"X Zhou","year":"2020","unstructured":"Zhou, X., Li, S., Feng, Y.: Quantum circuit transformation based on simulated annealing and heuristic search. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12), 4683\u20134694 (2020). https:\/\/doi.org\/10.1109\/TCAD.2020.2969647","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"11","key":"4815_CR19","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TC.2020.3023247","volume":"70","author":"S Li","year":"2021","unstructured":"Li, S., Zhou, X., Feng, Y.: Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Trans. Comput. 70(11), 1777\u20131788 (2021). https:\/\/doi.org\/10.1109\/TC.2020.3023247","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"4815_CR20","doi-asserted-by":"publisher","first-page":"4721","DOI":"10.1109\/TCAD.2020.2970594","volume":"39","author":"P Zhu","year":"2020","unstructured":"Zhu, P., Guan, Z., Cheng, X.: A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12), 4721\u20134735 (2020)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4815_CR21","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.: A hardware-aware heuristic for the qubit mapping problem in the NISQ era. IEEE Trans. Quantum Eng. 1, 1\u201314 (2020)","journal-title":"IEEE Trans. Quantum Eng."},{"issue":"8","key":"4815_CR22","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/TCAD.2021.3112143","volume":"41","author":"P Zhu","year":"2021","unstructured":"Zhu, P., Feng, S., Guan, Z.: An iterated local search methodology for the qubit mapping problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(8), 2587\u20132597 (2021)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4815_CR23","doi-asserted-by":"publisher","unstructured":"Aleksandrowicz, G., Alexander, T., Barkoutsos, P., et al.: Qiskit: an open-source framework for quantum computing (2019). https:\/\/doi.org\/10.5281\/zenodo.2562110","DOI":"10.5281\/zenodo.2562110"},{"key":"4815_CR24","doi-asserted-by":"publisher","unstructured":"Childs, A.M., Schoute, E., Unsal, C.M.: Circuit transformations for quantum architectures. In: 14th Conference on the Theory of Quantum Computation, Communication and Cryptography, pp. 3\u20131324. TQC, University of Maryland, College Park, Maryland, USA, (2019). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2019.3","DOI":"10.4230\/LIPIcs.TQC.2019.3"},{"key":"4815_CR25","doi-asserted-by":"crossref","unstructured":"Siraichi, M.Y., Santos, V.F.d., Collange, C., Pereira, F.M.Q.: Qubit allocation as a combination of subgraph isomorphism and token swapping. In: Proceedings of the ACM on Programming Languages 3(OOPSLA), 1\u201329 (2019)","DOI":"10.1145\/3360546"},{"key":"4815_CR26","doi-asserted-by":"publisher","unstructured":"Wu, T.-A., Jiang, Y.-J., Fang, S.-Y.: A robust quantum layout synthesis algorithm with a qubit mapping checker. In: Proceedings of the 41st IEEE\/ACM International Conference on Computer-Aided Design, pp. 1\u20139 (2022). https:\/\/doi.org\/10.1145\/3508352.3549394","DOI":"10.1145\/3508352.3549394"},{"key":"4815_CR27","unstructured":"Miltzow, T., Narins, L., Okamoto, Y., Rote, G., Thomas, A., Uno, T.: Approximation and hardness of token swapping. In: 24th Annual European Symposium on Algorithms (ESA 2016) (2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"4815_CR28","unstructured":"Qiskit Development Team: IBM Quantum Software Development Kit for writing quantum computing experiments, programs, and applications. GitHub (2017). https:\/\/github.com\/QISKit\/qiskit-sdk-py#license Accessed 03 Apr 2018"},{"key":"4815_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2025.3527399","volume":"6","author":"S Li","year":"2025","unstructured":"Li, S., Zhou, X., Feng, Y.: Benchmarking quantum circuit transformation with QKNOB circuits. IEEE Trans. Quantum Eng. 6, 1\u201315 (2025)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4815_CR30","doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: 38th International Symposium on Multiple Valued Logic (ismvl 2008), pp. 220\u2013225. IEEE (2008)","DOI":"10.1109\/ISMVL.2008.43"},{"issue":"5","key":"4815_CR31","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"issue":"10","key":"4815_CR32","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004). https:\/\/doi.org\/10.1109\/TPAMI.2004.75","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4815_CR33","doi-asserted-by":"crossref","unstructured":"Treinish, M., Carvalho, I., Tsilimigkounakis, G., S\u00e1, N.: Rustworkx: a high-performance graph library for python. arXiv preprint arXiv:2110.15221 (2021)","DOI":"10.21105\/joss.03968"},{"key":"4815_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104219","volume":"337","author":"Y Wang","year":"2024","unstructured":"Wang, Y., Jin, C., Cai, S.: Pathlad+: towards effective exact methods for subgraph isomorphism problem. Artif. Intell. 337, 104219 (2024). https:\/\/doi.org\/10.1016\/j.artint.2024.104219","journal-title":"Artif. Intell."},{"issue":"1","key":"4815_CR35","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.: t$$|\\text{ ket }\\rangle $$: a retargetable compiler for NISQ devices. Quantum Sci. Technol. 6(1), 014003 (2020)","journal-title":"Quantum Sci. Technol."},{"key":"4815_CR36","doi-asserted-by":"crossref","unstructured":"Zhou, X., Feng, Y., Li, S.: A monte carlo tree search framework for quantum circuit transformation. In: 2020 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 1\u20137. IEEE (2020)","DOI":"10.1145\/3400302.3415621"},{"key":"4815_CR37","doi-asserted-by":"crossref","unstructured":"Javanmard, Y., Liaubaite, U., Osborne, T.J., Xu, X., Yung, M.-H.: Matrix product state ansatz for the variational quantum solution of the Heisenberg model on Kagome geometries (2024). https:\/\/arxiv.org\/abs\/2401.02355","DOI":"10.1063\/5.0215573"},{"key":"4815_CR38","doi-asserted-by":"publisher","unstructured":"Li, Y., Zhang, Y., Chen, M., Li, X., Xu, P.: Timing-aware qubit mapping and gate scheduling adapted to neutral atom quantum computing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 1\u20131. (2023). https:\/\/doi.org\/10.1109\/TCAD.2023.3261244","DOI":"10.1109\/TCAD.2023.3261244"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04815-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04815-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04815-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T00:26:07Z","timestamp":1757204767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04815-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":38,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["4815"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04815-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"17 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"202"}}