{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T04:57:06Z","timestamp":1780117026305,"version":"3.54.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319599359","type":"print"},{"value":"9783319599366","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59936-6_18","type":"book-chapter","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T11:12:32Z","timestamp":1495624352000},"page":"232-247","source":"Crossref","is-referenced-by-count":18,"title":["Improving Synthesis of Reversible Circuits: Exploiting Redundancies in Paths and Nodes of QMDDs"],"prefix":"10.1007","author":[{"given":"Alwin","family":"Zulehner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Amar\u00f9, L.G., Gaillardon, P., Wille, R., Micheli, G.D.: Exploiting inherent characteristics of reversible circuits for faster combinational equivalence checking. In: Design, Automation and Test in Europe, pp. 175\u2013180 (2016)","DOI":"10.3850\/9783981537079_0152"},{"key":"18_CR2","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. CAD Integr. Circ. Syst. 32(6), 818\u2013830 (2013)"},{"issue":"6","key":"18_CR3","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)","journal-title":"IBM J. Res. Dev."},{"issue":"5","key":"18_CR4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCAD.2009.2017215","volume":"28","author":"D Gro\u00dfe","year":"2009","unstructured":"Gro\u00dfe, D., Wille, R., Dueck, G.W., Drechsler, R.: Exact multiple control Toffoli network synthesis with SAT techniques. IEEE Trans. CAD 28(5), 703\u2013715 (2009)","journal-title":"IEEE Trans. CAD"},{"issue":"3","key":"18_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Design Automation Conference, pp. 318\u2013323 (2003)","DOI":"10.1145\/775832.775915"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Thornton, M.A.: QMDD: a decision diagram structure for reversible and quantum circuits. In: International Symposium on Multi-Valued Logic, p. 6 (2006)","DOI":"10.1109\/ISMVL.2006.35"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffolli gates. In: International Symposium on Multi-Valued Logic, pp. 288\u2013293 (2011)","DOI":"10.1109\/ISMVL.2011.54"},{"key":"18_CR9","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: International Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242\u2013250 (2001)"},{"key":"18_CR10","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, New York (2000)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TCAD.2015.2459034","volume":"35","author":"P Niemann","year":"2016","unstructured":"Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: QMDDs: efficient quantum function representation and manipulation. IEEE Trans. CAD 35(1), 86\u201399 (2016)","journal-title":"IEEE Trans. CAD"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Reversible logic circuit synthesis. In: International Conference on CAD, pp. 353\u2013360 (2002)","DOI":"10.1145\/774572.774625"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-40578-0_22","volume-title":"Reversible Computation","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Dueck, G.W., Miller, D.M.: A fast symbolic transformation based algorithm for reversible logic synthesis. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 307\u2013321. Springer, Cham (2016). doi: 10.1007\/978-3-319-40578-0_22"},{"key":"18_CR14","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: a toolkit for reversible circuit design. In: Workshop on Reversible Computation, pp. 69\u201372 (2010). RevKit is available at http:\/\/www.revkit.org"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jsc.2015.03.002","volume":"73","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams. J. Symb. Comput. 73, 1\u201326 (2016)","journal-title":"J. Symb. Comput."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: ASP Design Automation Conference, pp. 85\u201392 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"key":"18_CR17","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0. 0. (2015)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R., Osewold, C., Ortiz, A.G.: Automatic design of low-power encoders using reversible circuit synthesis. In: Design, Automation and Test in Europe, pp. 1036\u20131041 (2012)","DOI":"10.1109\/DATE.2012.6176648"},{"key":"18_CR19","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: International Symposium on Multi-Valued Logic, pp. 220\u2013225 (2008). RevLib is available at http:\/\/www.revlib.org"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Wille, R., Keszocze, O., Hillmich, S., Walter, M., Ortiz, A.G.: Synthesis of approximate coders for on-chip interconnects using reversible logic. In: Design, Automation and Test in Europe (2016)","DOI":"10.3850\/9783981537079_0287"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Taking one-to-one mappings for granted: Advanced logic design of encoder circuits. In: Design, Automation and Test in Europe (2017)","DOI":"10.23919\/DATE.2017.7927101"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59936-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T21:04:14Z","timestamp":1569359054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59936-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319599359","9783319599366"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59936-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}