{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:16Z","timestamp":1780711396269,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Natural Science Foundation of Jiangsu Province","award":["BK20151274"],"award-info":[{"award-number":["BK20151274"]}]},{"name":"General Project of Natural Science Research of Jiangsu Higher School","award":["14KJB520033"],"award-info":[{"award-number":["14KJB520033"]}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX17_1916"],"award-info":[{"award-number":["KYCX17_1916"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11128-018-1908-8","type":"journal-article","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:41:30Z","timestamp":1527586890000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5637-2407","authenticated-orcid":false,"given":"Xueyun","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhijin","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiping","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"1908_CR1","doi-asserted-by":"crossref","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of 35th Annual IEEE Symposium on FOCS, Santa Fe, NM, USA, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1908_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM Symposium on Theory of Computing, Philadelphia, PA, USA, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"1908_CR3","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"7","key":"1908_CR4","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. VLSI Syst. 23(7), 1221\u20131234 (2015). https:\/\/doi.org\/10.1109\/TVLSI.2014.2337302","journal-title":"IEEE Trans. VLSI Syst."},{"key":"1908_CR5","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Determining the minimal number of swap gates for multidimensional nearest neighbor quantum circuits. In: Proceedings of ASP Design Automation Conference, Chiba, Japan, pp. 495\u2013500 (2014)"},{"issue":"4","key":"1908_CR6","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1109\/TC.2014.2315641","volume":"64","author":"K Datta","year":"2015","unstructured":"Datta, K., Sengupta, I., Rahaman, H.: A post synthesis optimization technique for reversible circuits exploiting negative control lines. IEEE Trans. Comput. 64(4), 1208\u20131214 (2015). https:\/\/doi.org\/10.1109\/TC.2014.2315641","journal-title":"IEEE Trans. Comput."},{"key":"1908_CR7","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wile, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Proceedings of ASP Design Automation Conference, Sydney, Australia, pp. 85\u201392 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"issue":"4","key":"1908_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/1278349.1278355","volume":"12","author":"D Maslov","year":"2007","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M.: Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42 (2007). https:\/\/doi.org\/10.1145\/1278349.1278355","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"1908_CR9","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Proceedings of Design Automation Conference, San Francisco, CA, USA, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"key":"1908_CR10","doi-asserted-by":"crossref","unstructured":"Kole, A., Datta, K.: Improved NCV gate realization of arbitrary size Toffoli gates. In: Proceedings of 2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID), Hyderabad, India, pp. 289\u2013294 (2017)","DOI":"10.1109\/VLSID.2017.11"},{"key":"1908_CR11","doi-asserted-by":"crossref","unstructured":"Miller, D., Wille, R., Sasanian, Z.: Elementary quantum gate realization for multiple-control Toffoli gates. In: Proceedings of International Symposium on Multiple-Valued Logic, Washington, DC, USA, pp. 288\u2013293 (2011)","DOI":"10.1109\/ISMVL.2011.54"},{"issue":"2","key":"1908_CR12","first-page":"356","volume":"15","author":"A Chakrabatri","year":"2007","unstructured":"Chakrabatri, A., Sur-Kolay, S.: Nearest neighbour based synthesis of quantum Boolean circuits. Eng. Lett. 15(2), 356\u2013361 (2007)","journal-title":"Eng. Lett."},{"issue":"1","key":"1908_CR13","first-page":"1","volume":"16","author":"MHA Khan","year":"2008","unstructured":"Khan, M.H.A.: Cost reduction in nearest neighbour based synthesis of quantum Boolean circuits. Eng. Lett. 16(1), 1\u20135 (2008)","journal-title":"Eng. Lett."},{"issue":"3","key":"1908_CR14","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). https:\/\/doi.org\/10.1007\/s11128-010-0201-2","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"1908_CR15","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). https:\/\/doi.org\/10.1109\/MCAS.2016.2549950","journal-title":"IEEE Circuits Syst. Mag."},{"key":"1908_CR16","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennet, C.H., Cleve, R., et al.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457\u20133467 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"issue":"3","key":"1908_CR17","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume":"85","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. Lecture Notes Comput. Sci. 85(3), 632\u2013644 (1980)","journal-title":"Lecture Notes Comput. Sci."},{"issue":"3\u20134","key":"1908_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkinand","year":"1982","unstructured":"Fredkinand, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3\u20134), 219\u2013253 (1982)","journal-title":"Int. J. Theor. Phys."},{"issue":"6","key":"1908_CR19","doi-asserted-by":"publisher","first-page":"3266","DOI":"10.1103\/PhysRevA.32.3266","volume":"32","author":"A Peres","year":"1985","unstructured":"Peres, A.: Reversible logic and quantum computers. Phys. Rev. A 32(6), 3266\u20133276 (1985)","journal-title":"Phys. Rev. A"},{"key":"1908_CR20","unstructured":"Rahman, M., Dueck, G.: Synthesis of linear nearest neighbor quantum circuits. In: Proceedings of 10th International Workshop on Boolean Problems, Freiberg, Germany (2012)"},{"key":"1908_CR21","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., et al.: RevLib: an online resource for reversible functions and reversible circuits. In: Proceedings of International Symposium on Multiple-Valued Logic, Washington, DC, USA, pp. 220\u2013225 (2008). http:\/\/www.revlib.org"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1908-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1908-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1908-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:33:08Z","timestamp":1751661188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1908-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1908"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1908-8","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"9 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"169"}}