{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:38:34Z","timestamp":1767843514741,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319994970","type":"print"},{"value":"9783319994987","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_16","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T08:45:39Z","timestamp":1534841139000},"page":"228-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures"],"prefix":"10.1007","author":[{"given":"Wakaki","family":"Hattori","sequence":"first","affiliation":[]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"16_CR1","unstructured":"Bhattacharjee, D., Chattopadhyay, A.: Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540 (2017)"},{"key":"16_CR2","unstructured":"Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbor synthesis of reversible circuits by graph partitioning. arXiv preprint arXiv:1112.0564 (2011)"},{"issue":"7","key":"16_CR3","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. Circ. Theory Appl. 45(7), 989\u20131000 (2017)","journal-title":"Int. J. Circ. Theory Appl."},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1007\/s11128-013-0725-3","volume":"13","author":"H Goudarzi","year":"2014","unstructured":"Goudarzi, H., Dousti, M.J., Shafaei, A., Pedram, M.: Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits. Quantum Inf. Process. 13(5), 1267\u20131299 (2014)","journal-title":"Quantum Inf. Process."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"1","key":"16_CR6","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 Info. Comput. 11(1), 142\u2013166 (2011)","journal-title":"Quantum Info. Comput."},{"issue":"7","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/TVLSI.2014.2337302","volume":"23","author":"CC Lin","year":"2015","unstructured":"Lin, C.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)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"16_CR8","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: 2015 20th Asia and South Pacific on Design Automation Conference (ASP-DAC), pp. 178\u2013183. IEEE (2015)","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"16_CR9","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.) RC 2011. LNCS, vol. 7165, pp. 89\u2013101. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_8"},{"issue":"10","key":"16_CR10","doi-asserted-by":"publisher","first-page":"100501","DOI":"10.1103\/PhysRevLett.97.100501","volume":"97","author":"CA Perez-Delgado","year":"2006","unstructured":"Perez-Delgado, C.A., Mosca, M., Cappellaro, P., Cory, D.G.: Single spin measurement using cellular automata techniques. Phys. Rev. Lett. 97(10), 100501 (2006)","journal-title":"Phys. Rev. Lett."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Rahman, M., Dueck, G.W.: Synthesis of linear nearest neighbor quantum circuits. arXiv preprint arXiv:1508.05430 (2015)","DOI":"10.1109\/ISMVL.2016.54"},{"issue":"9","key":"16_CR12","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. 16(9), 220 (2017)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"16_CR13","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":"16_CR14","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, p. 41. ACM (2013)","DOI":"10.1145\/2463209.2488785"},{"key":"16_CR15","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 on Design Automation Conference (ASP-DAC), pp. 495\u2013500. IEEE (2014)","DOI":"10.1109\/ASPDAC.2014.6742940"},{"issue":"5","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"16_CR17","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 on Design Automation Conference (ASP-DAC), pp. 292\u2013297. IEEE (2016)","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Wille, R., Lye, A., Drechsler, R.: Optimal SWAP gate insertion for nearest neighbor quantum circuits. In: 2014 19th Asia and South Pacific on Design Automation Conference (ASP-DAC), pp. 489\u2013494. IEEE (2014)","DOI":"10.1109\/ASPDAC.2014.6742939"},{"key":"16_CR19","unstructured":"Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. arXiv preprint arXiv:1004.4609 (2010)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Paler, A., Wille, R.: An efficient mapping of quantum circuits to the IBM QX architectures. arXiv preprint arXiv:1712.04722 (2017)","DOI":"10.23919\/DATE.2018.8342181"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T02:01:21Z","timestamp":1604800881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}