{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:47Z","timestamp":1751660507850},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208596"},{"type":"electronic","value":"9783319208602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20860-2_13","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:15:57Z","timestamp":1434701757000},"page":"200-215","source":"Crossref","is-referenced-by-count":6,"title":["Ricercar: A Language for Describing and\u00a0Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics"],"prefix":"10.1007","author":[{"given":"Michael Kirkedal","family":"Thomsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ipl.2014.01.003","volume":"114","author":"N Abdessaied","year":"2014","unstructured":"Abdessaied, N., Soeken, M., Thomsen, M.K., Drechsler, R.: Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters 114(6), 282\u2013286 (2014)","journal-title":"Information Processing Letters"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/Space Trade-Offs for reversible computation. SIAM Journal on Computing 18(4), 766\u2013776 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"35","key":"13_CR3","doi-asserted-by":"publisher","first-page":"6821","DOI":"10.1088\/0305-4470\/34\/35\/308","volume":"34","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Tromp, J., Vit\u00e1nyi, P.: Time and space bounds for reversible simulation. Journal of Physics A: Mathematical and General 34(35), 6821\u20136830 (2001)","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T., Munro, J.I., Raman, V.: Selection and sorting in the \u201crestore\u201d model. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 995\u20131004 (2014)","DOI":"10.1137\/1.9781611973402.74"},{"key":"13_CR5","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1 (2005)"},{"key":"13_CR6","unstructured":"De Vos, A., Rentergem, Y.V.: Reversible computing: from mathematical group theory to electronical circuit experiment. In: Proceedings of the Second Conference on Computing Frontiers, 2005, Ischia, Italy, May 4\u20136, 2005, pp. 35\u201344 (2005)"},{"key":"13_CR7","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":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-38986-3_10","volume-title":"Reversible Computation","author":"AS Green","year":"2013","unstructured":"Green, A.S., Lumsdaine, P.L.F., Ross, N.J., Selinger, P., Valiron, B.: An introduction to quantum programming in quipper. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 110\u2013124. Springer, Heidelberg (2013)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: Conference on Programming Language Design and Implementation, PLDI 2013, pp. 333\u2013342. ACM (2013)","DOI":"10.1145\/2499370.2462177"},{"issue":"15\u201316","key":"13_CR10","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.26421\/QIC14.15-16-3","volume":"14","author":"SP Jordan","year":"2014","unstructured":"Jordan, S.P.: Strong equivalence of reversible circuits is $${\\sf coNP}$$ coNP -complete. Quantum Information & Computation 14(15\u201316), 1302\u20131307 (2014)","journal-title":"Quantum Information & Computation"},{"key":"13_CR11","unstructured":"Kaarsgaard, R.: Towards a propositional logic for reversible logic circuits. In: de Haan, R. (ed.) Proceedings of the ESSLLI 2014 Student Session, pp. 33\u201341 (2014). http:\/\/www.kr.tuwien.ac.at\/drm\/dehaan\/stus2014\/proceedings.pdf"},{"key":"13_CR12","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, DAC, pp. 318\u2013323 (2003)","DOI":"10.1145\/775914.775915"},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","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. on CAD of Integrated Circuits and Systems 22(6), 710\u2013722 (2003)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-38986-3_16","volume-title":"Reversible Computation","author":"M Soeken","year":"2013","unstructured":"Soeken, M., Thomsen, M.K.: White dots do matter: rewriting reversible logic circuits. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 196\u2013208. Springer, Heidelberg (2013)"},{"key":"13_CR15","unstructured":"Soeken, M., Thomsen, M.K., Dueck, G.W., Miller, D.M.: Self-inverse functions and palindromic circuits. arXiv 1502.05825 (2015)"},{"issue":"5","key":"13_CR16","first-page":"307","volume":"5","author":"L Storme","year":"1999","unstructured":"Storme, L., De Vos, A., Jacobs, G.: Group theoretical aspects of reversible logic gates. J. UCS 5(5), 307\u2013321 (1999)","journal-title":"J. UCS"},{"issue":"6","key":"13_CR17","first-page":"636","volume":"8","author":"Y Takahashi","year":"2008","unstructured":"Takahashi, Y., Kunihiro, N.: A fast quantum circuit for addition with few qubits. Quantum Info. Comput. 8(6), 636\u2013649 (2008)","journal-title":"Quantum Info. Comput."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-34407-7_10","volume-title":"Implementation and Application of Functional Languages","author":"MK Thomsen","year":"2012","unstructured":"Thomsen, M.K.: Describing and optimising reversible logic using a functional language. In: Gill, A., Hage, J. (eds.) IFL 2011. LNCS, vol. 7257, pp. 148\u2013163. Springer, Heidelberg (2012)"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1142\/S0129626409000171","volume":"19","author":"MK Thomsen","year":"2009","unstructured":"Thomsen, M.K., Axelsen, H.B.: Parallelization of reversible ripple-carry adders. Parallel Processing Letters 19(1), 205\u2013222 (2009)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"13_CR20","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 54(1), 147\u2013153 (1996)","journal-title":"Physical Review A"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.vlsi.2013.08.002","volume":"47","author":"R Wille","year":"2014","unstructured":"Wille, R., Soeken, M., Miller, D.M., Drechsler, R.: Trading off circuit lines and gate costs in the synthesis of reversible logic. Integration, the VLSI Journal 47(2), 284\u2013294 (2014)","journal-title":"Integration, the VLSI Journal"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Principles of a reversible programming language. In: Conference on Computing Frontiers, CF, pp. 43\u201354. ACM Press (2008)","DOI":"10.1145\/1366230.1366239"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20860-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T05:34:27Z","timestamp":1652506467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20860-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208596","9783319208602"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20860-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}