{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T19:16:24Z","timestamp":1781032584731,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"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":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s42979-020-00398-3","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T13:06:18Z","timestamp":1609938378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits"],"prefix":"10.1007","volume":"2","author":[{"given":"Benjam\u00edn","family":"Bar\u00e1n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejo","family":"Carballude","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6081-9099","authenticated-orcid":false,"given":"Marcos","family":"Villagra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"398_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 MG, Ahmad I, Hamdan S. Harmony-search algorithm for 2d nearest neighbor quantum circuits realization. Exp Syst Appl. 2016;61:16\u201327.","journal-title":"Exp Syst Appl"},{"issue":"5","key":"398_CR2","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. Elementary gates for quantum computation. Phys Rev A. 1995;52(5):3457.","journal-title":"Phys Rev A"},{"key":"398_CR3","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). 2018; pp. 305\u2013310. 10.1109\/ISVLSI.2018.00063","DOI":"10.1109\/ISVLSI.2018.00063"},{"key":"398_CR4","unstructured":"Chakrabarti A, Sur-Kolay S, Chaudhury A. Linear nearest neighbor synthesis of reversible circuits by graph partitioning. arXiv preprint arXiv:1112.0564. 2011"},{"key":"398_CR5","unstructured":"Cheung D, Maslov D, Severini S. Translation techniques between quantum circuit architectures. In: Workshop on quantum information processing. 2007"},{"key":"398_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms7979","volume":"6","author":"AD C\u00f3rcoles","year":"2015","unstructured":"C\u00f3rcoles AD, Magesan E, Srinivasan SJ, Cross AW, Steffen M, Gambetta JM, Chow JM. Demonstration of a quantum error detection code using a square lattice of four superconducting qubits. Nat Commun. 2015;6:1\u201310.","journal-title":"Nat Commun"},{"issue":"2","key":"398_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evolut Comput. 2002;6(2):182\u201397.","journal-title":"IEEE Trans Evolut Comput"},{"issue":"7","key":"398_CR8","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1002\/cta.2335","volume":"45","author":"A Farghadan","year":"2017","unstructured":"Farghadan A, Mohammadzadeh N. Quantum circuit physical design flow for 2d nearest-neighbor architectures. Int J Cir Theory Appl. 2017;45(7):989\u20131000.","journal-title":"Int J Cir Theory Appl"},{"key":"398_CR9","doi-asserted-by":"crossref","unstructured":"Grover LK. A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing. 1996; pp. 212\u2013219. ACM","DOI":"10.1145\/237814.237866"},{"issue":"7068","key":"398_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1038\/nature04279","volume":"438","author":"H H\u00e4ffner","year":"2005","unstructured":"H\u00e4ffner H, H\u00e4nsel W, Roos C, Benhelm J, Chwalla M, K\u00f6rber T, Rapol U, Riebe M, Schmidt P, Becher C, et al. Scalable multiparticle entanglement of trapped ions. Nature. 2005;438(7068):643.","journal-title":"Nature"},{"issue":"15","key":"398_CR11","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow AW, Hassidim A, Lloyd S. Quantum algorithm for linear systems of equations. Phys Rev Lett. 2009;103(15):150502.","journal-title":"Phys Rev Lett"},{"key":"398_CR12","doi-asserted-by":"crossref","unstructured":"Hattori W, Yamashita S. Quantum circuit optimization by changing the gate order for 2d nearest neighbor architectures. In: International conference on reversible computation. 2018; pp. 228\u2013243. Springer","DOI":"10.1007\/978-3-319-99498-7_16"},{"key":"398_CR13","doi-asserted-by":"crossref","unstructured":"Hirata Y, Nakanishi M, Yamashita S, Nakashima, Y. An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture. In: Quantum, Nano and Micro Technologies, 2009. ICQNM\u201909. Third International Conference on. 2009; pp. 26\u201333. IEEE","DOI":"10.1109\/ICQNM.2009.25"},{"issue":"1","key":"398_CR14","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. 2011;11(1):142.","journal-title":"Quantum Inf Comput"},{"issue":"3","key":"398_CR15","first-page":"031007","volume":"2","author":"NC Jones","year":"2012","unstructured":"Jones NC, Van Meter R, Fowler AG, McMahon PL, Kim J, Ladd TD, Yamamoto Y. Layered architecture for quantum computing. Phys Rev X. 2012;2(3):031007.","journal-title":"Phys Rev X"},{"issue":"1","key":"398_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 Integ Circ Syst. 2018;37(1):182\u201392.","journal-title":"IEEE Trans Comput Aided Des Integ Circ Syst"},{"issue":"7","key":"398_CR17","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1088\/1367-2630\/13\/7\/073043","volume":"13","author":"M Kumph","year":"2011","unstructured":"Kumph M, Brownnutt M, Blatt R. Two-dimensional arrays of radio-frequency ion traps with addressable interactions. New J Phys. 2011;13(7):3043.","journal-title":"New J Phys"},{"issue":"7","key":"398_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TVLSI.2014.2337302","volume":"23","author":"CC Lin","year":"2015","unstructured":"Lin CC, Sur-Kolay S, Jha NK. Paqcs: physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans Very Large Scale Integ (VLSI) Syst. 2015;23(7):221\u20131234.","journal-title":"IEEE Trans Very Large Scale Integ (VLSI) Syst"},{"key":"398_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: Design automation conference (ASP-DAC), 2015 20th Asia and South Pacific. 2015; pp. 178\u2013183. IEEE","DOI":"10.1109\/ASPDAC.2015.7059001"},{"issue":"05","key":"398_CR20","doi-asserted-by":"publisher","first-page":"1950084","DOI":"10.1142\/S0218126619500841","volume":"28","author":"L Marbaniang","year":"2019","unstructured":"Marbaniang L, Datta K. Efficient design of quantum circuits using nearest neighbor constraint in 3d architecture. J Circ Syst Comput. 2019;28(05):1950084. https:\/\/doi.org\/10.1142\/S0218126619500841.","journal-title":"J Circ Syst Comput"},{"key":"398_CR21","doi-asserted-by":"crossref","unstructured":"Marbaniang L, Kole A, Datta K, Sengupta I. Design of efficient quantum circuits using nearest neighbor constraint in 2d architecture. In: International conference on reversible computation. 2017; pp. 248\u2013253. Springer","DOI":"10.1007\/978-3-319-59936-6_19"},{"issue":"25","key":"398_CR22","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov D, Dueck GW. Improved quantum cost for n-bit toffoli gates. Electr Lett. 2003;39(25):1790\u20131.","journal-title":"Electr Lett"},{"key":"398_CR23","doi-asserted-by":"crossref","unstructured":"Matsuo A, Yamashita S. Changing the gate order for optimal lnn conversion. In: International workshop on reversible computation. 2011; pp. 89\u2013101. Springer","DOI":"10.1007\/978-3-642-29517-1_8"},{"key":"398_CR24","doi-asserted-by":"crossref","unstructured":"Matsuo A, Yamashita S. An efficient method for quantum circuit placement problem on a 2-d grid. In: International conference on reversible computation. 2019; pp. 162\u2013168. Springer","DOI":"10.1007\/978-3-030-21500-2_10"},{"key":"398_CR25","unstructured":"Nielsen MA, Chuang IL. Quantum computation and quantum information (2000)"},{"key":"398_CR26","doi-asserted-by":"crossref","unstructured":"Ohliger M, Eisert J. Efficient measurement-based quantum computing with continuous-variable systems. Phys Rev A. 2012; 85(6): 062318","DOI":"10.1103\/PhysRevA.85.062318"},{"key":"398_CR27","doi-asserted-by":"crossref","unstructured":"Okamoto T, Tanaka K, Uchiyama S. Quantum public-key cryptosystems. In: Annual international cryptology conference. 2000; p. 147\u2013165. Springer","DOI":"10.1007\/3-540-44598-6_9"},{"issue":"10","key":"398_CR28","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1103\/PhysRevLett.97.100501","volume":"97","author":"CA P\u00e9rez-Delgado","year":"2006","unstructured":"P\u00e9rez-Delgado CA, Mosca M, Cappellaro P, Cory DG. Single spin measurement using cellular automata techniques. Phys Rev Lett. 2006;97(10):100\u2013501.","journal-title":"Phys Rev Lett"},{"key":"398_CR29","first-page":"2","volume":"8","author":"J Petit","year":"2003","unstructured":"Petit J. Experiments on the minimum linear arrangement problem. J Exp Algorithm (JEA). 2003;8:2\u20133.","journal-title":"J Exp Algorithm (JEA)"},{"key":"398_CR30","doi-asserted-by":"crossref","unstructured":"Rahman M, Dueck GW, et\u00a0al. Synthesis of linear nearest neighbor quantum circuits. arXiv preprint. 2015; arXiv:1508.05430","DOI":"10.1109\/ISMVL.2016.54"},{"issue":"9","key":"398_CR31","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/s11128-017-1662-3","volume":"16","author":"D Ruffinelli","year":"2017","unstructured":"Ruffinelli D, Bar\u00e1n B. Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective. Quantum Inf Process. 2017;16(9):220.","journal-title":"Quantum Inf Process"},{"key":"398_CR32","doi-asserted-by":"crossref","unstructured":"Shafaei A, Saeedi M, Pedram M. Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: Proceedings of the 50th annual design automation conference. 2013; p.\u00a041. ACM","DOI":"10.1145\/2463209.2488785"},{"key":"398_CR33","doi-asserted-by":"crossref","unstructured":"Shafaei A, Saeedi M, Pedram M. Qubit placement to minimize communication overhead in 2d quantum architectures. In: Design automation conference (ASP-DAC), 2014 19th Asia and South Pacific. 2014; pp. 495\u2013500. IEEE","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"398_CR34","doi-asserted-by":"crossref","unstructured":"Shrivastwa RR, Datta K, Sengupta I. Fast qubit placement in 2d architecture using nearest neighbor realization. In: Nanoelectronic and information systems (iNIS), 2015 IEEE international symposium on. 2015; pp. 95\u2013100. IEEE","DOI":"10.1109\/iNIS.2015.59"},{"key":"398_CR35","unstructured":"Spedalieri FM, Roychowdhury VP. Latency in local, two-dimensional, fault-tolerant quantum computing. 2008; arXiv preprint arXiv:0805.4213"},{"issue":"16","key":"398_CR36","doi-asserted-by":"publisher","first-page":"167005","DOI":"10.1103\/PhysRevLett.91.167005","volume":"91","author":"FW Strauch","year":"2003","unstructured":"Strauch FW, Johnson PR, Dragt AJ, Lobb C, Anderson J, Wellstood F. Quantum logic gates for coupled superconducting phase qubits. Phys Rev Lett. 2003;91(16):167005.","journal-title":"Phys Rev Lett"},{"issue":"3","key":"398_CR37","first-page":"707","volume":"58","author":"C von L\u00fccken","year":"2014","unstructured":"von L\u00fccken C, Bar\u00e1n B, Brizuela C. A survey on multi-objective evolutionary algorithms for many-objective problems. Comput Optim Appl. 2014;58(3):707\u201356.","journal-title":"Comput Optim Appl"},{"key":"398_CR38","doi-asserted-by":"crossref","unstructured":"Wille R, Gro\u00dfe D, Teuber L, Dueck GW, Drechsler R. Revlib: An online resource for reversible functions and reversible circuits. In: Multiple valued logic, 2008. ISMVL 2008. 38th international symposium on. 2008; pp. 220\u2013225. IEEE","DOI":"10.1109\/ISMVL.2008.43"},{"key":"398_CR39","unstructured":"Wille R, Saeedi M, Drechsler R. Synthesis of reversible functions beyond gate count and quantum cost. 2010; arXiv preprint arXiv:1004.4609"},{"key":"398_CR40","doi-asserted-by":"crossref","unstructured":"Wille R, Lye A, Drechsler R. Optimal swap gate insertion for nearest neighbor quantum circuits. In: Design automation conference (ASP-DAC), 2014 19th Asia and South Pacific. 2014; pp. 489\u2013494. IEEE","DOI":"10.1109\/ASPDAC.2014.6742939"},{"key":"398_CR41","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: Design automation conference (ASP-DAC), 2016 21st Asia and South Pacific. 2016; pp. 292\u2013297. IEEE","DOI":"10.1109\/ASPDAC.2016.7428026"},{"issue":"1808","key":"398_CR42","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1098\/rsta.2003.1205","volume":"361","author":"DJ Wineland","year":"2003","unstructured":"Wineland DJ, Barrett M, Britton J, Chiaverini J, DeMarco B, Itano WM, Jelenkovi\u0107 B, Langer C, Leibfried D, Meyer V, et al. Quantum information processing with trapped ions. Philos Trans R Soc London A Math Phys Eng Sci. 2003;361(1808):1349\u201361.","journal-title":"Philos Trans R Soc London A Math Phys Eng Sci"},{"issue":"4","key":"398_CR43","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka C. Grover\u2019s quantum searching algorithm is optimal. Phys Rev A. 1999;60(4):2746.","journal-title":"Phys Rev A"},{"key":"398_CR44","doi-asserted-by":"crossref","unstructured":"Zulehner A, Gasser S, Wille R. Exact global reordering for nearest neighbor quantum circuits using $$A^*$$. In: International conference on reversible computation. 2017; pp. 185\u2013201. Springer","DOI":"10.1007\/978-3-319-59936-6_15"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00398-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-020-00398-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00398-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T21:10:03Z","timestamp":1612905003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-020-00398-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,6]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["398"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00398-3","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,6]]},"assertion":[{"value":"12 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","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 report no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}