{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:36:33Z","timestamp":1725737793324},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389856"},{"type":"electronic","value":"9783642389863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38986-3_5","type":"book-chapter","created":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T00:54:03Z","timestamp":1372467243000},"page":"46-57","source":"Crossref","is-referenced-by-count":3,"title":["Strength of the Reversible, Garbage-Free 2 k \u00b11 Multiplier"],"prefix":"10.1007","author":[{"given":"Eva","family":"Rotenberg","sequence":"first","affiliation":[]},{"given":"James","family":"Cranch","sequence":"additional","affiliation":[]},{"given":"Michael Kirkedal","family":"Thomsen","sequence":"additional","affiliation":[]},{"given":"Holger Bock","family":"Axelsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-36315-3_14","volume-title":"Reversible Computation","author":"H.B. Axelsen","year":"2013","unstructured":"Axelsen, H.B., Thomsen, M.K.: Garbage-free reversible integer multiplication with constants of the form 2\n                    k\n                  \u00b12\n                    l\n                  \u00b11. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol.\u00a07581, pp. 171\u2013182. Springer, Heidelberg (2013)"},{"unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A New Quantum Ripple-carry Addition Circuit arXiv:quant-ph\/0410184 (2005)","key":"5_CR2"},{"unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A Logarithmic-Depth Quantum Carry-Lookahead Adder arXiv:quant-ph\/0406142 (2008)","key":"5_CR3"},{"issue":"3-4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E. Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Conservative Logic. International Journal of Theoretical Physics\u00a021(3-4), 219\u2013253 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-38986-3_7","volume-title":"RC 2013","author":"T.\u00c6. Mogensen","year":"2013","unstructured":"Mogensen, T.\u00c6.: Garbage-Free Reversible Constant Multipliers for Arbitrary Integers. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol.\u00a07948, pp. 70\u201383. Springer, Heidelberg (2013)"},{"unstructured":"Parvardi, A.H.: Lifting The Exponent, LTE (2011), \n                    \n                      http:\/\/www.artofproblemsolving.com\/Resources\/Papers\/LTE.pdf","key":"5_CR6"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1142\/S0129626409000171","volume":"19","author":"M.K. Thomsen","year":"2009","unstructured":"Thomsen, M.K., Axelsen, H.B.: Parallelization of Reversible Ripple-carry Adders. Parallel Processing Letters\u00a019(1), 205\u2013222 (2009)","journal-title":"Parallel Processing Letters"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T. Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible Computing. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"issue":"4","key":"5_CR9","first-page":"339","volume":"1","author":"Y. Rentergem Van","year":"2005","unstructured":"Van Rentergem, Y., De Vos, A.: Optimal Design of a Reversible Full Adder. International Journal of Unconventional Computing\u00a01(4), 339\u2013355 (2005)","journal-title":"International Journal of Unconventional Computing"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V. Vedral","year":"1996","unstructured":"Vedral, V., Barenco, A., Ekert, A.: Quantum Networks for Elementary Arithmetic Operations. Physical Review A\u00a054(1), 147\u2013153 (1996)","journal-title":"Physical Review A"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01692444","volume":"3","author":"K. Zsigmondy","year":"1892","unstructured":"Zsigmondy, K.: Zur Theorie der Potenzreste. Monatshefte f\u00fcr Mathematik und Physik\u00a03(1), 265\u2013284 (1892)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38986-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:06:58Z","timestamp":1557896818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38986-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389856","9783642389863"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38986-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}