{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:06:03Z","timestamp":1770138363527,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T00:00:00Z","timestamp":1584403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T00:00:00Z","timestamp":1584403200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s11128-020-02630-8","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T16:40:58Z","timestamp":1584463258000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Mathematical formulation of quantum circuit design problems in networks of quantum computers"],"prefix":"10.1007","volume":"19","author":[{"given":"R.","family":"van Houte","sequence":"first","affiliation":[]},{"given":"J.","family":"Mulderij","sequence":"additional","affiliation":[]},{"given":"T.","family":"Attema","sequence":"additional","affiliation":[]},{"given":"I.","family":"Chiscop","sequence":"additional","affiliation":[]},{"given":"F.","family":"Phillipson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,17]]},"reference":[{"key":"2630_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.eswa.2016.04.038","volume":"61","author":"MG AlFailakawi","year":"2016","unstructured":"AlFailakawi, M.G., Ahmad, I., Hamdan, S.: Harmony-search algorithm for 2D nearest neighbor quantum circuits realization. Expert Syst. Appl. 61, 16\u201327 (2016)","journal-title":"Expert Syst. Appl."},{"key":"2630_CR2","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Wille, R., Drechsler, R., Rahaman, H.: A novel approach for nearest neighbor realization of 2D quantum circuits. In: 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 305\u2013310. IEEE, Hong Kong (2018)","DOI":"10.1109\/ISVLSI.2018.00063"},{"key":"2630_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Wille, R., Drechsler, R., Rahaman, H.: Improved look-ahead approaches for nearest neighbor synthesis of 1D quantum circuits. In: 2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID), pp. 203\u2013208. IEEE, Delhi, NCR (2019)","DOI":"10.1109\/VLSID.2019.00054"},{"key":"2630_CR4","first-page":"1","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H Buhrman","year":"2003","unstructured":"Buhrman, H., R\u00f6hrig, H.: Distributed quantum computing. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) Mathematical Foundations of Computer Science 2003, pp. 1\u201320. Springer, Berlin (2003)"},{"issue":"7","key":"2630_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s11128-018-1908-8","volume":"17","author":"X Cheng","year":"2018","unstructured":"Cheng, X., Guan, Z., Ding, W.: Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits. Quantum Inf. Process. 17(7), 169 (2018)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"2630_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2287696.2287707","volume":"8","author":"BS Choi","year":"2012","unstructured":"Choi, B.S., Van Meter, R.: An $$\\Theta (\\sqrt{\\{}n\\})$$-depth quantum adder on a 2D NTC quantum computer architecture. J. Emerg. Technol. Comput. Syst. 8(3), 1\u201322 (2012)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"issue":"3","key":"2630_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1412700.1412718","volume":"39","author":"VS Denchev","year":"2008","unstructured":"Denchev, V.S., Pandurangan, G.: Distributed quantum computing: A new frontier in distributed systems or science fiction? SIGACT News 39(3), 77\u201395 (2008)","journal-title":"SIGACT News"},{"key":"2630_CR8","doi-asserted-by":"crossref","unstructured":"Ding, J., Yamashita, S.: Exact synthesis of nearest neighbor compliant quantum circuits in 2D architecture and its application to large-scale circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1 (2019)","DOI":"10.1109\/TCAD.2019.2907919"},{"issue":"9\u201311","key":"2630_CR9","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1002\/1521-3978(200009)48:9\/11<771::AID-PROP771>3.0.CO;2-E","volume":"48","author":"DP DiVincenzo","year":"2000","unstructured":"DiVincenzo, D.P.: IBM: the physical implementation of quantum computation. Fortschr. Phys. 48(9\u201311), 771\u2013783 (2000)","journal-title":"Fortschr. Phys."},{"key":"2630_CR10","doi-asserted-by":"crossref","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)","DOI":"10.1109\/DSD.2018.00005"},{"issue":"3","key":"2630_CR11","doi-asserted-by":"publisher","first-page":"035001","DOI":"10.1088\/2058-9565\/ab177a","volume":"4","author":"A Farghadan","year":"2019","unstructured":"Farghadan, A., Mohammadzadeh, N.: Mapping quantum circuits on 3D nearest-neighbor architectures. Quantum Sci. Technol. 4(3), 035001 (2019)","journal-title":"Quantum Sci. Technol."},{"key":"2630_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-99498-7_16","volume-title":"Reversible Computation","author":"W Hattori","year":"2018","unstructured":"Hattori, W., Yamashita, S.: Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures. In: Kari, J., Ulidowski, I. (eds.) Reversible Computation. Lecture Notes in Computer Science, pp. 228\u2013243. Springer, Berlin (2018)"},{"issue":"1&2","key":"2630_CR13","first-page":"142","volume":"11","author":"Y Hirata","year":"2011","unstructured":"Hirata, Y., Nakanishi, M., Yamashita, S., Nakashima, Y.: An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quantum Inf. Comput. 11(1&2), 142\u2013166 (2011)","journal-title":"Quantum Inf. Comput."},{"issue":"5\u20137","key":"2630_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1002\/(SICI)1521-3978(200005)48:5\/7<553::AID-PROP553>3.0.CO;2-K","volume":"48","author":"P Kok","year":"2000","unstructured":"Kok, P., Braunstein, S.L.: Entanglement swapping as event-ready entanglement preparation. Fortschr. Phys. Prog. Phys. 48(5\u20137), 553\u2013557 (2000)","journal-title":"Fortschr. Phys. Prog. Phys."},{"issue":"1","key":"2630_CR15","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.: A heuristic for linear nearest neighbor realization of quantum circuits by SWAP gate insertion using $$N$$-gate lookahead. IEEE J. Emerg. Sel. Topics Circuits Syst. 6(1), 62\u201372 (2016)","journal-title":"IEEE J. Emerg. Sel. Topics Circuits Syst."},{"issue":"1","key":"2630_CR16","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. Aided Des. Integr. Circuits Syst. 37(1), 182\u2013192 (2018)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"2630_CR17","first-page":"273","volume":"9138","author":"A Kole","year":"2015","unstructured":"Kole, A., Datta, K., Sengupta, I., Wille, R.: Towards a cost metric for nearest neighbor constraints in reversible circuits. Rev. Comput. 9138, 273\u2013278 (2015)","journal-title":"Rev. Comput."},{"issue":"7","key":"2630_CR18","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/TVLSI.2014.2337302","volume":"23","author":"C Lin","year":"2015","unstructured":"Lin, C., Sur-Kolay, S., Jha, N.K.: PAQCS: physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans. Very Large Scale Int. Syst. 23(7), 1221\u20131234 (2015)","journal-title":"IEEE Trans. Very Large Scale Int. Syst."},{"key":"2630_CR19","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"2630_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-29517-1_8","volume-title":"Reversible Computation","author":"A Matsuo","year":"2012","unstructured":"Matsuo, A., Yamashita, S.: Changing the gate order for optimal LNN conversion. In: De Vos, A., Wille, R. (eds.) Reversible Computation. Lecture Notes in Computer Science, pp. 89\u2013101. Springer, Berlin (2012)"},{"key":"2630_CR21","unstructured":"Mulderij, J.: Nearest neighbor compliance. Master\u2019s thesis, Delft University of Technology (2019)"},{"key":"2630_CR22","unstructured":"Mulderij, J., Aardal, K., Chiscop, I., Phillipson, F.: A polynomial size model with implicit swap gate counting for exact qubit reordering. Submitted (2019)"},{"key":"2630_CR23","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"5","key":"2630_CR24","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1119\/1.1463744","volume":"70","author":"MA Nielsen","year":"2002","unstructured":"Nielsen, M.A., Chuang, I.L., Grover, L.K.: Quantum computation and quantum information. Am. J. Phys. 70(5), 558\u2013559 (2002)","journal-title":"Am. J. Phys."},{"issue":"2","key":"2630_CR25","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCAS.2016.2549950","volume":"16","author":"M Pedram","year":"2016","unstructured":"Pedram, M., Shafaei, A.: Layout optimization for quantum circuits with linear nearest neighbor architectures. IEEE Circuits Syst. Mag. 16(2), 62\u201374 (2016)","journal-title":"IEEE Circuits Syst. Mag."},{"key":"2630_CR26","doi-asserted-by":"crossref","unstructured":"Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth (2012). arXiv:1207.6655 [quant-ph]","DOI":"10.26421\/QIC13.11-12-3"},{"issue":"3","key":"2630_CR27","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. Quantum Inf. Process. 10(3), 355\u2013377 (2011)","journal-title":"Quantum Inf. Process."},{"key":"2630_CR28","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2463209.2488785"},{"key":"2630_CR29","doi-asserted-by":"crossref","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 (2014)","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"2630_CR30","doi-asserted-by":"crossref","unstructured":"Shrivastwa, R.R., Datta, K., Sengupta, I.: Fast qubit placement in 2D architecture using nearest neighbor realization. In: 2015 IEEE International Symposium on Nanoelectronic and Information Systems, pp. 95\u2013100 (2015)","DOI":"10.1109\/iNIS.2015.59"},{"issue":"3","key":"2630_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11128-018-1832-y","volume":"17","author":"Y Tan","year":"2018","unstructured":"Tan, Y., Cheng, X., Guan, Z., Liu, Y., Ma, H.: Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit. Quantum Inf. Process. 17(3), 61 (2018)","journal-title":"Quantum Inf. Process."},{"key":"2630_CR32","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam9288","author":"S Wehner","year":"2018","unstructured":"Wehner, S., Elkouss, D., Hanson, R.: Quantum internet: a vision for the road ahead. Science (2018). https:\/\/doi.org\/10.1126\/science.aam9288","journal-title":"Science"},{"key":"2630_CR33","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: Proceedings of the 56th Annual Design Automation Conference 2019 on DAC \u201919, pp. 1\u20136. ACM Press, Las Vegas (2019)","DOI":"10.1145\/3316781.3317859"},{"key":"2630_CR34","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 (2008)","DOI":"10.1109\/ISMVL.2008.43"},{"key":"2630_CR35","doi-asserted-by":"crossref","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. IEEE, Macao (2016)","DOI":"10.1109\/ASPDAC.2016.7428026"},{"issue":"12","key":"2630_CR36","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. Aided Des. Integr. Circuits Syst. 33(12), 1818\u20131831 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"2630_CR37","doi-asserted-by":"crossref","unstructured":"Yimsiriwattana, A., Lomonaco\u00a0Jr, S.J.: Distributed quantum computing: a distributed shor algorithm. In: Quantum Information and Computation II, vol. 5436, pp. 360\u2013372. International Society for Optics and Photonics (2004)","DOI":"10.1117\/12.546504"},{"key":"2630_CR38","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-21500-2_11","volume-title":"Reversible Computation","author":"A Zulehner","year":"2019","unstructured":"Zulehner, A., Bauer, H., Wille, R.: Evaluating the flexibility of A* for mapping quantum circuits. In: Thomsen, M.K., Soeken, M. (eds.) Reversible Computation, vol. 11497, pp. 171\u2013190. Springer, Cham (2019)"},{"issue":"7","key":"2630_CR39","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TCAD.2018.2846658","volume":"38","author":"A Zulehner","year":"2019","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 (2019)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-020-02630-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:31:44Z","timestamp":1615941104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-020-02630-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,17]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2630"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02630-8","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,17]]},"assertion":[{"value":"3 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"141"}}