{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:51:50Z","timestamp":1772301110732,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00354-022-00163-5","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T10:03:01Z","timestamp":1647252181000},"page":"311-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Mapping Quantum Circuits in IBM Q Devices Using Progressive Qubit Assignment for Global Ordering"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2254-1663","authenticated-orcid":false,"given":"Lalengmawia","family":"Chhangte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Chakrabarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"163_CR1","doi-asserted-by":"publisher","unstructured":"Alfailakawi, M.G., Ahmad, I., Hamdan, S.: Harmony-search algorithm for 2D nearest neighbor quantum circuits realization. Expert Syst. Appl. 61(C), 16\u201327 (2016) https:\/\/doi.org\/10.1016\/j.eswa.2016.04.038","DOI":"10.1016\/j.eswa.2016.04.038"},{"key":"163_CR2","unstructured":"Bhattacharjee, D., Chattopadhyay, A.: Depth-optimal quantum circuit placement for arbitrary topologies. CoRR abs\/1703.08540 (2017). arXiv:org\/abs\/1703.08540"},{"key":"163_CR3","unstructured":"Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbor synthesis of reversible circuits by graph partitioning. CoRR (2011). arXiv:org\/abs\/1112.0564"},{"key":"163_CR4","doi-asserted-by":"publisher","unstructured":"Chhangte, L., Chakrabarty, A.: Optimization of local ordering technique for nearest neighbour circuits. In: A.\u00a0Bhattacharjee, S.K. Borgohain, B.\u00a0Soni, G.\u00a0Verma, X.Z. Gao (eds.) Machine Learning, Image Processing, Network Security and Data Sciences, pp. 182\u2013192. Springer Singapore, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6318-8_16","DOI":"10.1007\/978-981-15-6318-8_16"},{"key":"163_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1049\/iet-cdt.2019.0257","volume":"14","author":"L Chhangte","year":"2020","unstructured":"Chhangte, L., Chakrabarty, A.: Technique for two-dimensional nearest neighbour realisation of quantum circuits using weighted look-ahead. IET Comput. Digit. Tech. 14, 281\u2013289 (2020). https:\/\/doi.org\/10.1049\/iet-cdt.2019.0257","journal-title":"IET Comput. Digit. Tech."},{"key":"163_CR6","unstructured":"Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv e-prints arXiv:1707.03429 (2017). arXiv:org\/abs\/1707.03429v2"},{"key":"163_CR7","doi-asserted-by":"publisher","unstructured":"Dueck, G.W., Pathak, A., Rahman, M.M., Shukla, A., Banerjee, A.: Optimization of circuits for ibm\u2019s five-qubit quantum computers. In: 2018 21st Euromicro Conference on Digital System Design (DSD), pp. 680\u2013684 (2018). https:\/\/doi.org\/10.1109\/DSD.2018.00005","DOI":"10.1109\/DSD.2018.00005"},{"issue":"6","key":"163_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/2499370.2462177","volume":"48","author":"AS Green","year":"2013","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. SIGPLAN Not. 48(6), 333\u2013342 (2013). https:\/\/doi.org\/10.1145\/2499370.2462177","journal-title":"SIGPLAN Not."},{"key":"163_CR9","unstructured":"IBM QX device. https:\/\/quantumexperience.ng.bluemix.net\/qx\/devices. Accessed: 2021-11-10"},{"key":"163_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.vlsi.2019.10.004","volume":"70","author":"T Itoko","year":"2020","unstructured":"Itoko, T., Raymond, R., Imamichi, T., Matsuo, A.: Optimization of quantum circuit mapping using gate transformation and commutation. Integration 70, 43\u201350 (2020). https:\/\/doi.org\/10.1016\/j.vlsi.2019.10.004","journal-title":"Integration"},{"key":"163_CR11","doi-asserted-by":"publisher","unstructured":"Javadi\u00a0Abhari, A., Patil, S., Kudrow, D., Heckey, J., Lvov, A., Chong, F.T., Martonosi, M.: Scaffcc: A framework for compilation and analysis of quantum computing programs. In: Proceedings of the 11th ACM Conference on Computing Frontiers, CF \u201914. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2597917.2597939","DOI":"10.1145\/2597917.2597939"},{"key":"163_CR12","doi-asserted-by":"publisher","unstructured":"Kole, A., Datta, K.: Improved ncv gate realization of arbitrary size toffoli gates. In: 2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID), pp. 289\u2013294 (2017). https:\/\/doi.org\/10.1109\/VLSID.2017.11","DOI":"10.1109\/VLSID.2017.11"},{"issue":"1","key":"163_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/TCAD.2017.2693284","volume":"37","author":"A Kole","year":"2018","unstructured":"Kole, A., Datta, K., Sengupta, I.: A new heuristic for N-dimensional nearest neighbor realization of a quantum circuit. IEEE Trans. Comput. Aid. Design Integr. Circ. Syst. 37(1), 182\u2013192 (2018). https:\/\/doi.org\/10.1109\/TCAD.2017.2693284","journal-title":"IEEE Trans. Comput. Aid. Design Integr. Circ. Syst."},{"issue":"10","key":"163_CR14","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1109\/TCAD.2019.2962753","volume":"39","author":"A Kole","year":"2020","unstructured":"Kole, A., Hillmich, S., Datta, K., Wille, R., Sengupta, I.: Improved mapping of quantum circuits to ibm qx architectures. IEEE Trans. Comput. Aid. Design Integr. Circ. Syst. 39(10), 2375\u20132383 (2020). https:\/\/doi.org\/10.1109\/TCAD.2019.2962753","journal-title":"IEEE Trans. Comput. Aid. Design Integr. Circ. Syst."},{"key":"163_CR15","doi-asserted-by":"publisher","unstructured":"Li, G., Ding, Y., Xie, Y.: 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. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3297858.3304023","DOI":"10.1145\/3297858.3304023"},{"key":"163_CR16","doi-asserted-by":"publisher","unstructured":"Lin, C., Sur-Kolay, S., Jha, N.K.: PAQCS: Physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(7), 1221\u20131234 (2015). https:\/\/doi.org\/10.1109\/TVLSI.2014.2337302","DOI":"10.1109\/TVLSI.2014.2337302"},{"key":"163_CR17","doi-asserted-by":"publisher","unstructured":"Lye, A., Wille, R., Drechsler, R.: 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 (2015). https:\/\/doi.org\/10.1109\/ASPDAC.2015.7059001","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"163_CR18","unstructured":"Mapping of quantum circuits. https:\/\/iic.jku.at\/eda\/research\/ibm_qx_mapping\/. Accessed: 2021-11-01"},{"key":"163_CR19","unstructured":"Matsumoto, K., Amano, K.: Representation of quantum circuits with clifford and $$\\pi \/8$$ gates (2008). arXiv:org\/abs\/0806.3834"},{"key":"163_CR20","doi-asserted-by":"publisher","unstructured":"Matsuo, A., Hattori, W., Yamashita, S.: Reducing the overhead of mapping quantum circuits to ibm q system. In: 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135 (2019). https:\/\/doi.org\/10.1109\/ISCAS.2019.8702439","DOI":"10.1109\/ISCAS.2019.8702439"},{"key":"163_CR21","doi-asserted-by":"publisher","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control toffoli gates. In: 2011 41st IEEE International Symposium on Multiple-Valued Logic, pp. 288\u2013293 (2011). https:\/\/doi.org\/10.1109\/ISMVL.2011.54","DOI":"10.1109\/ISMVL.2011.54"},{"issue":"10","key":"163_CR22","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1007\/s11128-013-0601-1","volume":"12","author":"A Mohammad","year":"2013","unstructured":"Mohammad, A., Laila, A., Imtiaz, A., Suha, H.: Line ordering of reversible circuits for linear nearest neighbor realization. Quant. Inform. Process. 12(10), 3319\u20133339 (2013). https:\/\/doi.org\/10.1007\/s11128-013-0601-1","journal-title":"Quant. Inform. Process."},{"key":"163_CR23","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011)","edition":"10"},{"key":"163_CR24","doi-asserted-by":"publisher","unstructured":"Niemann, P., de\u00a0Almeida, A.A.A., Dueck, G., Drechler, R.: Design space exploration in the mapping of reversible circuits to ibm quantum computers. In: 2020 Euromicro Conference on Digital System Design (DSD), vol.\u00a01, pp. 401\u2013407. IEEE Computer Society, Los Alamitos, CA, USA (2020). https:\/\/doi.org\/10.1109\/DSD51259.2020.00070","DOI":"10.1109\/DSD51259.2020.00070"},{"key":"163_CR25","unstructured":"Paler, A.: On the influence of initial qubit placement during NISQ circuit compilation. arXiv e-prints (2018). arXiv:org\/abs\/1811.08985v2"},{"key":"163_CR26","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","DOI":"10.22331\/q-2018-08-06-79"},{"key":"163_CR27","unstructured":"Qiskit. https:\/\/qiskit.org\/. Accessed: 2021-11-10"},{"key":"163_CR28","doi-asserted-by":"publisher","unstructured":"Rahman, M.M., Dueck, G.W., Chattopadhyay, A., Wille, R.: Integrated synthesis of linear nearest neighbor ancilla-free MCT circuits. In: 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 144\u2013149 (2016). https:\/\/doi.org\/10.1109\/ISMVL.2016.54","DOI":"10.1109\/ISMVL.2016.54"},{"issue":"3","key":"163_CR29","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11128-010-0201-2","volume":"10","author":"M Saeedi","year":"2011","unstructured":"Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quant. Inform. Process. 10(3), 355\u2013377 (2011). https:\/\/doi.org\/10.1007\/s11128-010-0201-2","journal-title":"Quant. Inform. Process."},{"key":"163_CR30","doi-asserted-by":"publisher","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: 2013 50th ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2013). https:\/\/doi.org\/10.1145\/2463209.2488785","DOI":"10.1145\/2463209.2488785"},{"key":"163_CR31","doi-asserted-by":"publisher","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Qubit placement to minimize communication overhead in 2D quantum architectures. In: 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 495\u2013500. IEEE (2014). https:\/\/doi.org\/10.1109\/ASPDAC.2014.6742940","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"163_CR32","doi-asserted-by":"publisher","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, CGO 2018, p. 113\u2013125. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3168822","DOI":"10.1145\/3168822"},{"key":"163_CR33","doi-asserted-by":"publisher","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. Dallas, TX (2008). https:\/\/doi.org\/10.1109\/ISMVL.2008.43","DOI":"10.1109\/ISMVL.2008.43"},{"key":"163_CR34","unstructured":"Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. In: International Workshop on Logic Synthesis (IWLS) (2010). arXiv:org\/abs\/1004.4609"},{"issue":"12","key":"163_CR35","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1109\/TCAD.2014.2356463","volume":"33","author":"R Wille","year":"2014","unstructured":"Wille, R., Lye, A., Drechsler, R.: Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Trans. Comput. Aid. Design Integr. Circ. Syst. 33(12), 1818\u20131831 (2014). https:\/\/doi.org\/10.1109\/TCAD.2014.2356463","journal-title":"IEEE Trans. Comput. Aid. Design Integr. Circ. Syst."},{"key":"163_CR36","doi-asserted-by":"publisher","unstructured":"Wille, R., Keszocze, O., Walter, M., Rohrs, P., Chattopadhyay, A., Drechsler, R.: 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 (2016). https:\/\/doi.org\/10.1109\/ASPDAC.2016.7428026","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"163_CR37","doi-asserted-by":"publisher","unstructured":"Wille, R., Burgholzer, L., Zulehner, A.: 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, DAC \u201919. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3316781.3317859","DOI":"10.1145\/3316781.3317859"},{"key":"163_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2015.01.052","volume":"586","author":"K Yamanaka","year":"2015","unstructured":"Yamanaka, K., Demaine, E.D., Ito, T., Kawahara, J., Kiyomi, M., Okamoto, Y., Saitoh, T., Suzuki, A., Uchizawa, K., Uno, T.: Swapping labeled tokens on graphs. Theor. Comput. Sci. 586, 81\u201394 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.052","journal-title":"Theor. Comput. Sci."},{"key":"163_CR39","doi-asserted-by":"publisher","unstructured":"Zhang, X., Xiang, H., Xiang, T., Fu, L., Sang, J.: An efficient quantum circuits optimizing scheme compared with qiskit. In: Collaborative Computing: Networking, Applications and Worksharing, pp. 467\u2013476. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12981-1_32","DOI":"10.1007\/978-3-030-12981-1_32"},{"key":"163_CR40","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Paler, A., Wille, R.: Efficient mapping of quantum circuits to the IBM QX architectures. In: 2018 Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1135\u20131138 (2018). https:\/\/doi.org\/10.23919\/DATE.2018.8342181","DOI":"10.23919\/DATE.2018.8342181"},{"key":"163_CR41","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Wille, R.: Compiling su(4) quantum circuits to ibm qx architectures. In: ASPDAC \u201919: Proceedings of the 24th Asia and South Pacific Design Automation Conference, pp. 185\u2013190. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3287624.3287704","DOI":"10.1145\/3287624.3287704"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00354-022-00163-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T16:48:22Z","timestamp":1661532502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00354-022-00163-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s00354-022-00163-5","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"6 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}