{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:37Z","timestamp":1740123577062,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61961023"],"award-info":[{"award-number":["61961023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20202BABL202007"],"award-info":[{"award-number":["20202BABL202007"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Foundation of Guangxi University of Science and Technology","award":["21Z04"],"award-info":[{"award-number":["21Z04"]}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2021GXNSFAA220046"],"award-info":[{"award-number":["2021GXNSFAA220046"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10836-022-05987-z","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T18:06:53Z","timestamp":1648231613000},"page":"39-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Synthesis of Reversible Circuits with Reduced Nearest-Neighbor Cost Using Kronecker Functional Decision Diagrams"],"prefix":"10.1007","volume":"38","author":[{"given":"Dengli","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junjie","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengjie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haohao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"5987_CR1","doi-asserted-by":"publisher","first-page":"156001","DOI":"10.1109\/ACCESS.2020.3019356","volume":"8","author":"BK Abdalhaq","year":"2020","unstructured":"Abdalhaq BK, Awad A, Hawash A (2020) Reversible logic synthesis using binary decision diagrams with exploiting efficient reordering operators. IEEE Access 8:156001\u2013156016","journal-title":"IEEE Access"},{"key":"5987_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31937-7","volume-title":"Reversible and Quantum Circuits: Optimization and Complexity Analysis","author":"N Abdessaied","year":"2016","unstructured":"Abdessaied N, Drechsler R (2016) Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer International Publishing AG"},{"key":"5987_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.vlsi.2019.04.008","volume":"69","author":"D Bu","year":"2019","unstructured":"Bu D, Wang P (2019) An improved KFDD based reversible circuit synthesis method. Integr VLSI J 69:251\u2013265","journal-title":"Integr VLSI J"},{"issue":"9","key":"5987_CR4","doi-asserted-by":"publisher","first-page":"1825","DOI":"10.1109\/TCAD.2020.3032072","volume":"40","author":"A Deb","year":"2021","unstructured":"Deb A, Dueck GW, Wille R (2021) Exploring the potential benefits of alternative quantum computing architectures. IEEE Trans Comput Aided Des Integr Circuits Syst 40(9):1825\u20131835","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"5","key":"5987_CR5","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TCAD.2019.2907919","volume":"39","author":"J Ding","year":"2020","unstructured":"Ding J, Yamashita S (2020) Exact synthesis of nearest neighbor compliant quantum circuits in 2-D architecture and its application to large-scale circuits. IEEE Trans Comput Aided Des Integr Circuits Syst 39(5):1045\u20131058","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"10","key":"5987_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1109\/43.728917","volume":"17","author":"R Drechsler","year":"1998","unstructured":"Drechsler R, Becker B (1998) Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions. IEEE Trans Comput Aided Des Integr Circuits Syst 17(10):965\u2013973","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5987_CR7","doi-asserted-by":"crossref","unstructured":"Fazel K, Thornton MA, Rice JE (2007) ESOP-based toffoli gate cascade generation. In: Proc. 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. pp 206\u2013209","DOI":"10.1109\/PACRIM.2007.4313212"},{"issue":"11","key":"5987_CR8","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TCAD.2006.871622","volume":"25","author":"P Gupta","year":"2006","unstructured":"Gupta P, Agrawal A, Jha NK (2006) An algorithm for synthesis of reversible logic circuits. IEEE Trans Comput Aided Des Integr Circuits Syst 25(11):2317\u20132330","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"10","key":"5987_CR9","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1109\/TCAD.2019.2962753","volume":"39","author":"A Kole","year":"2020","unstructured":"Kole A, Hillmich S, Datta K, Wille R, Sengupta I (2020) Improved mapping of quantum circuits to IBM QX architectures. IEEE Trans Comput Aided Des Integr Circuits Syst 39(10):2375\u20132383","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"1","key":"5987_CR10","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 (2016) 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","journal-title":"IEEE J Emerg Sel Top Circuits Syst"},{"key":"5987_CR11","doi-asserted-by":"crossref","unstructured":"Kole A, Datta K, Sengupta I, Wille R (2015) Towards a cost metric for nearest neighbor constraints in reversible circuits. In: Proc. International Conference on Reversible Computation. pp 273\u2013278","DOI":"10.1007\/978-3-319-20860-2_18"},{"issue":"11","key":"5987_CR12","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TC.2020.3023247","volume":"70","author":"S Li","year":"2021","unstructured":"Li S, Zhou X, Feng Y (2021) Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Trans Comput 70(11):1777\u20131788","journal-title":"IEEE Trans Comput"},{"key":"5987_CR13","doi-asserted-by":"crossref","unstructured":"Lin CC, Jha NK (2014) RMDDS: Reed-Muller decision diagram synthesis of reversible logic circuits.\u00a0ACM J Emerg Technol Comput Syst\u00a010(2): Article 14, 25 pages","DOI":"10.1145\/2564923"},{"issue":"1","key":"5987_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1126257.1126259","volume":"2","author":"RV Meter","year":"2006","unstructured":"Meter RV, Oskin M (2006) Architectural implications of quantum computing technologies. ACM J Emerging Technologies Comp Syst 2(1):31\u201363","journal-title":"ACM J Emerging Technologies Comp Syst"},{"key":"5987_CR15","doi-asserted-by":"crossref","unstructured":"Miller DM, Maslov D, Dueck GW (2003) A transformation based algorithm for reversible logic synthesis. In: Proc. the 40th Annual Design Automation Conference. pp 318\u2013323","DOI":"10.1145\/775832.775915"},{"key":"5987_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information: 10th","author":"MA Nielsen","year":"2010","unstructured":"Nielsen MA, Chuang IL (2010) Quantum Computation and Quantum Information: 10th, Anniversary. Cambridge University Press, New York, USA","edition":"Anniversary"},{"key":"5987_CR17","doi-asserted-by":"crossref","unstructured":"Niemann P, Bandyopadhyay C, Drechsler R (2021) Combining SWAPs and remote Toffoli gates in the mapping to IBM QX architectures. In: Proc. 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). pp 200\u2013205","DOI":"10.23919\/DATE51398.2021.9474217"},{"key":"5987_CR18","doi-asserted-by":"crossref","unstructured":"Niemann P, Gupta A, Drechsler R (2019) T-depth optimization for fault-tolerant quantum circuits. In: Proc. 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL). pp 108\u2013113","DOI":"10.1109\/ISMVL.2019.00027"},{"issue":"3","key":"5987_CR19","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 (2011) Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf Process 10(3):355\u2013377","journal-title":"Quantum Inf Process"},{"key":"5987_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3","volume-title":"Switching Theory for Logic Synthesis","author":"T Sasao","year":"1999","unstructured":"Sasao T (1999) Switching Theory for Logic Synthesis. Springer, Boston, MA"},{"issue":"9","key":"5987_CR21","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1109\/TCAD.2018.2859251","volume":"38","author":"M Soeken","year":"2019","unstructured":"Soeken M, Roetteler M, Wiebe N, Micheli GD (2019) LUT-based hierarchical reversible logic synthesis. IEEE Trans Comput Aided Des Integr Circuits Syst 38(9):1675\u20131688","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5987_CR22","doi-asserted-by":"crossref","unstructured":"Soeken M, Wille R, Drechsler R (2010) Hierarchical synthesis of reversible circuits using positive and negative davio decomposition. In: Proc. 2010 5th International Design and Test Workshop (IDT). pp 143\u2013148","DOI":"10.1109\/IDT.2010.5724427"},{"key":"5987_CR23","doi-asserted-by":"crossref","unstructured":"Stojkovi\u0107 S, Stankovi\u0107 R, Moraga C, Stankovi\u0107 M (2020) Reversible circuits synthesis from functional decision diagrams by using node dependency matrices. J Circuits Syst Comput 29(5): Article 2050079, 32 pages","DOI":"10.1142\/S0218126620500796"},{"key":"5987_CR24","doi-asserted-by":"crossref","unstructured":"Wille R, Drechsler R (2009) BDD-based synthesis of reversible logic for large functions. In: Proc. the 46th Annual Design Automation Conference. pp 270\u2013275","DOI":"10.1145\/1629911.1629984"},{"key":"5987_CR25","doi-asserted-by":"crossref","unstructured":"Wille R, Gro\u00dfe D, Teuber L, Dueck GW, Drechsler R (2008) RevLib: an online resource for reversible functions and reversible circuits. In: Proc. 38th International Symposium on Multiple Valued Logic. pp 220\u2013225","DOI":"10.1109\/ISMVL.2008.43"},{"issue":"2","key":"5987_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11128-013-0642-5","volume":"13","author":"R Wille","year":"2014","unstructured":"Wille R, Lye A, Drechsler R (2014) Considering nearest neighbor constraints of quantum circuits at the reversible circuit level. Quantum Inf Process 13(2):185\u2013199","journal-title":"Quantum Inf Process"},{"issue":"12","key":"5987_CR27","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 (2014) Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Trans Comput Aided Des Integr Circuits Syst 33(12):1818\u20131831","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5987_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9579-4","volume-title":"Towards a Design Flow for Reversible Logic","author":"R Wille","year":"2010","unstructured":"Wille R, Drechsler R (2010) Towards a Design Flow for Reversible Logic. Springer, Dordrecht"},{"issue":"5","key":"5987_CR29","first-page":"996","volume":"37","author":"A Zulehner","year":"2018","unstructured":"Zulehner A, Wille R (2018) One-pass design of reversible circuits: combining embedding and synthesis for reversible logic. IEEE Trans Comput Aided Des Integr Circuits Syst 37(5):996\u20131008","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5987_CR30","doi-asserted-by":"crossref","unstructured":"Soeken M, Frehse S, Wille R, Drechsler R (2011) RevKit: an open source toolkit for thedesign of reversible circuits. In: Proc. International Conference on Reversible Computation. pp 64\u201376","DOI":"10.1007\/978-3-642-29517-1_6"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-022-05987-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10836-022-05987-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-022-05987-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T04:28:27Z","timestamp":1650947307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10836-022-05987-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["5987"],"URL":"https:\/\/doi.org\/10.1007\/s10836-022-05987-z","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"13 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest to this work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interests"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}