{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:47Z","timestamp":1780711427968,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60873069"],"award-info":[{"award-number":["60873069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"General Project of Natural Science Research of Colleges and Universities of Jiangsu Province, China","award":["14KJB520033"],"award-info":[{"award-number":["14KJB520033"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20151274"],"award-info":[{"award-number":["BK20151274"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"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,3]]},"DOI":"10.1007\/s11128-018-1832-y","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T14:39:13Z","timestamp":1517409553000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit"],"prefix":"10.1007","volume":"17","author":[{"given":"Ying-ying","family":"Tan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xue-yun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-jin","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiying","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"12","key":"1832_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1147\/rd.441.0261","volume":"44","author":"R Landauer","year":"2000","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 44(12), 261\u2013269 (2000)","journal-title":"IBM J. Res. Dev."},{"issue":"6","key":"1832_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"9","key":"1832_CR3","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TC.2011.144","volume":"61","author":"O Golubitsky","year":"2012","unstructured":"Golubitsky, O., Maslov, D.: A study of optimal 4-bit reversible Toffoli circuits and their synthesis. IEEE Trans. Comput. 61(9), 1341\u20131353 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"1832_CR4","doi-asserted-by":"crossref","unstructured":"Wan, S., Chen, H., Cao, R.: A novel transformation-based algorithm for reversible logic synthesis. In: Proceedings of the 4th International Symposium on Intelligence Computation and Applications (ISICA), vol. 5821, pp. 70\u201381 (2009)","DOI":"10.1007\/978-3-642-04843-2_9"},{"key":"1832_CR5","unstructured":"Cheng, X., Guan, Z.: Linear nearest neighbor quantum circuit synthesis based on valid Boolean matrix. Chin. J. Quantum Electron.( ) 33(6), 743\u2013750 (2016) (in Chinese)"},{"issue":"20","key":"1832_CR6","doi-asserted-by":"publisher","first-page":"4091","DOI":"10.1103\/PhysRevLett.74.4091","volume":"74","author":"JI Cirac","year":"1995","unstructured":"Cirac, J.I., Zoller, P.: Quantum computations with cold trapped ions. Phys. Rev. Lett. 74(20), 4091\u20134094 (1995)","journal-title":"Phys. Rev. Lett."},{"key":"1832_CR7","volume-title":"Using $$\\uppi $$ \u03c0","author":"R Wille","year":"2016","unstructured":"Wille, R., Quetschlich, N., Inoue, Y., Yasuda, N., Minato, S.I.: Using $$\\uppi $$ \u03c0 DDs for Nearest Neighbor Optimization of Quantum Circuits. Reversible Computation. Springer International Publishing, New York (2016)"},{"issue":"10","key":"1832_CR8","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1007\/s11128-013-0601-1","volume":"12","author":"M Alfailakawi","year":"2013","unstructured":"Alfailakawi, M., Alterkawi, L., Ahmad, I., et al.: Line ordering of reversible circuits for linear nearest neighbor realization. Quantum Inf. Process. 12(10), 3319\u20133339 (2013)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"1832_CR9","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":"1832_CR10","doi-asserted-by":"crossref","unstructured":"Rahman, M.M., Dueck, G.W., Chattopadhyay, A., Wille, R.: Integrated synthesis of linear nearest neighbor Ancilla-free MCT circuits. In: IEEE, International Symposium on Multiple-Valued Logic, pp. 144\u2013149. IEEE (2016)","DOI":"10.1109\/ISMVL.2016.54"},{"issue":"12","key":"1832_CR11","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."},{"issue":"1","key":"1832_CR12","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. Top. Circuits Syst. 6(1), 62\u201372 (2016)","journal-title":"IEEE J. Emerg. Sel. Top. Circuits Syst."},{"key":"1832_CR13","doi-asserted-by":"crossref","unstructured":"Deb, A., Wille, R., Drechsler, R., Das, D.K.: An efficient reduction of common control lines for reversible circuit optimization. In: IEEE International Symposium on Multiple-Valued Logic, pp. 14\u201319. IEEE (2015)","DOI":"10.1109\/ISMVL.2015.26"},{"key":"1832_CR14","doi-asserted-by":"crossref","unstructured":"Ali, M.B., Hirayama, T., Yamanaka, K., Nishitani, Y.: Quantum cost reduction of reversible circuits using new Toffoli decomposition techniques. In: International Conference on Computational Science and Computational Intelligence, pp. 59\u201364. IEEE (2016)","DOI":"10.1109\/CSCI.2015.41"},{"key":"1832_CR15","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Sasanian, Z.: Lowering the quantum gate cost of reversible circuits. In: IEEE International Midwest Symposium on Circuits and Systems, pp. 260\u2013263. IEEE (2010)","DOI":"10.1109\/MWSCAS.2010.5548653"},{"key":"1832_CR16","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. Cambridge University Press, Cambridge (2011)"},{"issue":"9","key":"1832_CR17","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCAD.2005.858352","volume":"25","author":"WNN Hung","year":"2006","unstructured":"Hung, W.N.N., Song, X., Yang, G., et al.: Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9), 1652\u20131663 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"1832_CR18","doi-asserted-by":"crossref","unstructured":"Drechsler, R., Wille, R.: From Truth Tables to Programming Languages: Progress in the Design of Reversible Circuits. 4(10):78-85 (2011)","DOI":"10.1109\/ISMVL.2011.40"},{"key":"1832_CR19","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"key":"1832_CR20","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. IEEE International Symposium on Multiple-Valued Logic, vol. 47, pp. 288\u2013293. IEEE (2011)","DOI":"10.1109\/ISMVL.2011.54"},{"key":"1832_CR21","doi-asserted-by":"crossref","unstructured":"Wille, R., Keszocze, O., Walter M., et al.: Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Asia and South Pacific Design Automation Conference. IEEE, vol. 2001, pp. 292\u2013297","DOI":"10.1109\/ASPDAC.2016.7428026"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1832-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1832-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1832-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T09:37:13Z","timestamp":1751276233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1832-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,31]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1832"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1832-y","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,31]]},"assertion":[{"value":"4 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"61"}}