{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:36:56Z","timestamp":1758123416996,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405773"},{"type":"electronic","value":"9783319405780"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40578-0_17","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T16:25:20Z","timestamp":1467217520000},"page":"223-238","source":"Crossref","is-referenced-by-count":10,"title":["Application of Permutation Group Theory in Reversible Logic Synthesis"],"prefix":"10.1007","author":[{"given":"Dmitry V.","family":"Zakablukov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-642-38986-3_18","volume-title":"Reversible Computation","author":"N Abdessaied","year":"2013","unstructured":"Abdessaied, N., Wille, R., Soeken, M., Drechsler, R.: Reducing the depth of quantum circuits using additional circuit lines. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 221\u2013233. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-38986-3_18"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Arabzadeh, M., Saeedi, M., Zamani, M.S.: Rule-based optimization of reversible circuits. In: 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 849\u2013854 (2010). http:\/\/dx.org\/10.1109\/ASPDAC.2010.5419684","DOI":"10.1109\/ASPDAC.2010.5419684"},{"key":"17_CR3","unstructured":"Arabzadeh, M., Saeedi, M.: RCViewer+ \u2014 a viewer\/analyzer for reversible and quantum circuits (2013). http:\/\/ceit.aut.ac.ir\/QDA\/RCV.htm"},{"issue":"6","key":"17_CR4","doi-asserted-by":"crossref","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). http:\/\/dx.org\/10.1147\/rd.176.0525","journal-title":"IBM J. Res. Dev."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Iwama, K., Kambayashi, Y., Yamashita, S.: Transformation rules for designing CNOT-based quantum circuits. In: Proceedings of 39th Annual Design Automation Conference (DAC 2002), NY, USA, pp. 419\u2013424 (2002). http:\/\/dx.org\/10.1145\/513918.514026","DOI":"10.1109\/DAC.2002.1012662"},{"issue":"3","key":"17_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. Comput.-Aided Des. 27(3), 436\u2013444 (2008). http:\/\/dx.org\/10.1109\/TCAD.2007.911334","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"17_CR7","unstructured":"Maslov, D.A.: Reversible logic synthesis benchmarks page (2011). http:\/\/webhome.cs.uvic.ca\/~dmaslov\/"},{"key":"17_CR8","unstructured":"Maslov, D.A.: On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization. CoRR abs\/1508.03273 (2016). http:\/\/arxiv.org\/abs\/1508.03273"},{"issue":"4","key":"17_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/1278349.1278355","volume":"12","author":"DA Maslov","year":"2007","unstructured":"Maslov, D.A., Dueck, G.W., Miller, D.M.: Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42 (2007). http:\/\/dx.org\/10.1145\/1278349.1278355","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Drechsler, R.: Reducing reversible circuit cost by adding lines. In: Proceedings of 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010), pp. 217\u2013222 (2010). http:\/\/dx.org\/10.1109\/ISMVL.2010.48","DOI":"10.1109\/ISMVL.2010.48"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-319-08494-7_10","volume-title":"Reversible Computation","author":"MZ Rahman","year":"2014","unstructured":"Rahman, M.Z., Rice, J.E.: Templates for positive and negative control Toffoli networks. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 125\u2013136. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-08494-7_10"},{"issue":"2","key":"17_CR12","doi-asserted-by":"crossref","first-page":"21:1","DOI":"10.1145\/2431211.2431220","volume":"45","author":"M Saeedi","year":"2013","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits \u2014 a survey. ACM Comput. Surv. 45(2), 21:1\u201321:34 (2013). http:\/\/dx.org\/10.1145\/2431211.2431220","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"17_CR13","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1877745.1877747","volume":"6","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Zamani, M.S., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. ACM J. Emerg. Technol. Comput. Syst. 6(4), 13:1\u201313:26 (2010). http:\/\/dx.org\/10.1145\/1877745.1877747","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"17_CR14","unstructured":"Schaeffer, B., Perkowski, M.A.: A cost minimization approach to synthesis of linear reversible circuits. CoRR abs\/1407.0070 (2014). http:\/\/arxiv.org\/abs\/1407.0070"},{"issue":"6","key":"17_CR15","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"VV Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. Comput.-Aided Des. 22(6), 710\u2013722 (2003). http:\/\/dx.org\/10.1109\/TCAD.2003.811448","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"17_CR16","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: Proceedings of 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), pp. 220\u2013225 (2008). http:\/\/www.revlib.org"},{"key":"17_CR17","first-page":"275","volume":"3","author":"DV Zakablukov","year":"2014","unstructured":"Zakablukov, D.V.: Reduction of the reversible circuits gate complexity without using the equivalent replacement tables for the gate compositions. BMSTU J. Sci. Educ. 3, 275\u2013289 (2014). (in Russian), http:\/\/dx.org\/10.7463\/0314.0699195","journal-title":"BMSTU J. Sci. Educ."},{"key":"17_CR18","unstructured":"Zakablukov, D.V.: On asymptotic gate complexity and depth of reversible circuits without additional memory. CoRR abs\/1504.06876 (2015). http:\/\/arxiv.org\/abs\/1504.06876"},{"key":"17_CR19","unstructured":"Zakablukov, D.V.: ReversibleLogicGenerator Software (2015). https:\/\/github.com\/dmitry-zakablukov\/ReversibleLogicGenerator"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40578-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:28:28Z","timestamp":1498310908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}