{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:46:00Z","timestamp":1781973960556,"version":"3.54.5"},"reference-count":128,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006034","name":"University of Southern California","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006034","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p>Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, postsynthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms\u2014search based, cycle based, transformation based, and BDD based\u2014as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.<\/jats:p>","DOI":"10.1145\/2431211.2431220","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T15:00:42Z","timestamp":1362754842000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":201,"title":["Synthesis and optimization of reversible circuits\u2014a survey"],"prefix":"10.1145","volume":"45","author":[{"given":"Mehdi","family":"Saeedi","sequence":"first","affiliation":[{"name":"Amirkabir University of Technology, Iran, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,3,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Altepeter J. Jeffrey E. and Kwiat P. 2005. Photonic state tomography. Adv. At. Mol. Opt. Phys. 52. 105--159.  Altepeter J. Jeffrey E. and Kwiat P. 2005. Photonic state tomography. Adv. At. Mol. Opt. Phys. 52. 105--159.","DOI":"10.1016\/S1049-250X(05)52003-2"},{"key":"e_1_2_1_3_1","unstructured":"Arabzadeh M. and Saeedi M. 2011. RCviewer&plus; A viewer\/analyzer for reversible and quantum circuits version 1.88. http:\/\/ceit.aut.ac.ir\/QDA\/RCV.htm.  Arabzadeh M. and Saeedi M. 2011. RCviewer&plus; A viewer\/analyzer for reversible and quantum circuits version 1.88. http:\/\/ceit.aut.ac.ir\/QDA\/RCV.htm."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Asia and South Pacific Design Automation Conference. 849--854","author":"Arabzadeh M.","year":"2010","unstructured":"Arabzadeh , M. , Saeedi , M. , and Saheb Zamani , M. 2010 . Rule-Based optimization of reversible circuits . In Proceedings of the Asia and South Pacific Design Automation Conference. 849--854 . Arabzadeh, M., Saeedi, M., and Saheb Zamani, M. 2010. Rule-Based optimization of reversible circuits. In Proceedings of the Asia and South Pacific Design Automation Conference. 849--854."},{"key":"e_1_2_1_5_1","unstructured":"Asano M. and Ishii C. 2005. New structural quantum circuit simulating a toffoli gate. arXiv:quant-ph\/0512016.  Asano M. and Ishii C. 2005. New structural quantum circuit simulating a toffoli gate. arXiv:quant-ph\/0512016."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646375"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1034"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052330"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999108"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_2_1_13_1","unstructured":"Bushnell M. and Agrawal V. 2000. Essentials of Electronic Testing for Digital Memory and Mixed-Signal VLSI Circuits. Kluwer.  Bushnell M. and Agrawal V. 2000. Essentials of Electronic Testing for Digital Memory and Mixed-Signal VLSI Circuits. Kluwer."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the International Symposium on Information and Communication Technologies. 1--6.","author":"Cheung D.","year":"2004","unstructured":"Cheung , D. 2004 . Improved bounds for the approximate qft . In Proceedings of the International Symposium on Information and Communication Technologies. 1--6. Cheung, D. 2004. Improved bounds for the approximate qft. In Proceedings of the International Symposium on Information and Communication Technologies. 1--6."},{"key":"e_1_2_1_15_1","unstructured":"Cheung D. Maslov D. Mathew J. and Pradhan D. K. 2009. On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. Quant. Inf. Comput. 9 7&8 610--621.   Cheung D. Maslov D. Mathew J. and Pradhan D. K. 2009. On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. Quant. Inf. Comput. 9 7&8 610--621."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the Workshop on Quantum Information.","author":"Cheung D.","year":"2007","unstructured":"Cheung , D. , Maslov , D. , and Severini ., S. 2007 . Translation techniques between quantum circuit architectures . In Proceedings of the Workshop on Quantum Information. Cheung, D., Maslov, D., and Severini., S. 2007. Translation techniques between quantum circuit architectures. In Proceedings of the Workshop on Quantum Information."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000502.2000504"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the Workshop on Quantum Information.","author":"Cuccaro S. A.","unstructured":"Cuccaro , S. A. , Draper , T. G. , Kutin , S. A. , and Moulton , D. P . 2005. A new quantum ripple-carry addition circuit . In Proceedings of the Workshop on Quantum Information. Cuccaro, S. A., Draper, T. G., Kutin, S. A., and Moulton, D. P. 2005. A new quantum ripple-carry addition circuit. In Proceedings of the Workshop on Quantum Information."},{"key":"e_1_2_1_20_1","unstructured":"Dally W. and Towles B. 2003. Principles and Practices of Interconnection Networks. Morgan Kaufmann.   Dally W. and Towles B. 2003. Principles and Practices of Interconnection Networks. Morgan Kaufmann."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.02.003"},{"key":"e_1_2_1_22_1","volume-title":"Reversible Computing","author":"De Vos A.","unstructured":"De Vos , A. 2010b. Reversible Computing . Wiley-VCH. De Vos, A. 2010b. Reversible Computing. Wiley-VCH."},{"key":"e_1_2_1_23_1","first-page":"33","article-title":"Generating the group of reversible logic gates","volume":"35","author":"De Vos A.","year":"2002","unstructured":"De Vos , A. , Raa , B. , and Storme , L. 2002 . Generating the group of reversible logic gates . J. Phys. A 35 , 33 , 7063. De Vos, A., Raa, B., and Storme, L. 2002. Generating the group of reversible logic gates. J. Phys. A 35, 33, 7063.","journal-title":"J. Phys. A"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(02)00051-2"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.200"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330521.1330523"},{"key":"e_1_2_1_27_1","first-page":"21","article-title":"Discrete non-abelian gauge theories in josephson-junction arrays and quantum computation","volume":"69","author":"Douc\u00e7ot B.","year":"2004","unstructured":"Douc\u00e7ot , B. , Ioffe , L. B. , and Vidal , J. 2004 . Discrete non-abelian gauge theories in josephson-junction arrays and quantum computation . Phys. Rev. B 69 , 21 . Douc\u00e7ot, B., Ioffe, L. B., and Vidal, J. 2004. Discrete non-abelian gauge theories in josephson-junction arrays and quantum computation. Phys. Rev. B 69, 21.","journal-title":"Phys. Rev. B"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258761"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the IEEE Pacific Rim Conference on Communications. 206--209","author":"Fazel K.","unstructured":"Fazel , K. , Thornton , M. , and Rice , J . 2007. ESOP-Based toffoli gate cascade generation . In Proceedings of the IEEE Pacific Rim Conference on Communications. 206--209 . Fazel, K., Thornton, M., and Rice, J. 2007. ESOP-Based toffoli gate cascade generation. In Proceedings of the IEEE Pacific Rim Conference on Communications. 206--209."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1088\/0256-307X\/19\/8\/306"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01886518"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011827.2011828"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.042314"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.020501"},{"key":"e_1_2_1_36_1","first-page":"367","article-title":"A method for automatic program inversion based on ir(0) parsing","volume":"66","author":"Gl\u00fcck R.","year":"2005","unstructured":"Gl\u00fcck , R. and Kawabe , M. 2005 . A method for automatic program inversion based on ir(0) parsing . Fundam. Inf. 66 , 4, 367 -- 395 . Gl\u00fcck, R. and Kawabe, M. 2005. A method for automatic program inversion based on ir(0) parsing. Fundam. Inf. 66, 4, 367--395.","journal-title":"Fundam. Inf."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837440"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.144"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Grassl M. 2003. Circuits for quantum error-correcting codes. http:\/\/iaks-www.ira.uka.de\/home\/grassl\/QECC\/index.html.  Grassl M. 2003. Circuits for quantum error-correcting codes. http:\/\/iaks-www.ira.uka.de\/home\/grassl\/QECC\/index.html.","DOI":"10.1201\/9781420035377.pt5"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"e_1_2_1_42_1","unstructured":"Hachtel G. D. and Somenzi F. 2000. Logic Synthesis and Verification Algorithms. Kluwer.   Hachtel G. D. and Somenzi F. 2000. Logic Synthesis and Verification Algorithms. Kluwer."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature04279"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-008-0212-8"},{"key":"e_1_2_1_45_1","first-page":"1","article-title":"An efficient conversion of quantum circuits to a linear nearest neighbor architecture","volume":"11","author":"Hirata Y.","year":"2011","unstructured":"Hirata , Y. , Nakanishi , M. , Yamashita , S. , and Nakashima , Y. 2011 . An efficient conversion of quantum circuits to a linear nearest neighbor architecture . Quant. Inf. Comput. 11 , 1 -- 2 , 142--166. Hirata, Y., Nakanishi, M., Yamashita, S., and Nakashima, Y. 2011. An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quant. Inf. Comput. 11, 1--2, 142--166.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.858352"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/513918.514026"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/30156"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996789"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.91"},{"key":"e_1_2_1_52_1","volume-title":"Algorithms Theory Computation Handbook.","author":"Korf R.","unstructured":"Korf , R. 1999. Artificial intelligence search algorithms . In Algorithms Theory Computation Handbook. , CRC Press . Korf, R. 1999. Artificial intelligence search algorithms. In Algorithms Theory Computation Handbook., CRC Press."},{"key":"e_1_2_1_53_1","article-title":"Computation at a distance. Chicago","author":"Kutin S.","year":"2007","unstructured":"Kutin , S. , Moulton , D. , and Smithline , L. 2007 . Computation at a distance. Chicago J. Theor. Comput. Sci. Kutin, S., Moulton, D., and Smithline, L. 2007. Computation at a distance. Chicago J. Theor. Comput. Sci.","journal-title":"J. Theor. Comput. Sci."},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the Asian Conference on Quantu Information Science.","author":"Kutin S. A.","year":"2007","unstructured":"Kutin , S. A. 2007 . Shor's algorithm on a nearest-neighbor machine . In Proceedings of the Asian Conference on Quantu Information Science. Kutin, S. A. 2007. Shor's algorithm on a nearest-neighbor machine. In Proceedings of the Asian Conference on Quantu Information Science."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.75.012331"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90037-X"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_2_1_58_1","first-page":"5","article-title":"The cost of quantum gate primitives","volume":"12","author":"Lee S.","year":"2006","unstructured":"Lee , S. , Lee , S. , Kim , T. , Lee , J. S. , Biamonte , J. , and Perkowski , M. 2006 . The cost of quantum gate primitives . J. Multiple-Valued Logic Soft Comput. 12 , 5 -- 6 . Lee, S., Lee, S., Kim, T., Lee, J. S., Biamonte, J., and Perkowski, M. 2006. The cost of quantum gate primitives. J. Multiple-Valued Logic Soft Comput. 12, 5--6.","journal-title":"J. Multiple-Valued Logic Soft Comput."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the International Workshop on Logic Synthesis.","author":"Markov I. L.","unstructured":"Markov , I. L. and Roy , J. A . 2003. On sub-optimallity and scalability of logic synthesis tools . In Proceedings of the International Workshop on Logic Synthesis. Markov, I. L. and Roy, J. A. 2003. On sub-optimallity and scalability of logic synthesis tools. In Proceedings of the International Workshop on Logic Synthesis."},{"key":"e_1_2_1_60_1","first-page":"5","article-title":"Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info","volume":"12","author":"Markov I. L.","year":"2012","unstructured":"Markov , I. L. and Saeedi , M. 2012 . Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info . Comput. 12 , 5 -- 6 , 361--394. Markov, I. L. and Saeedi, M. 2012. Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info. Comput. 12, 5--6, 361--394.","journal-title":"Comput."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.012310"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052310"},{"key":"e_1_2_1_63_1","unstructured":"Maslov D. 2011. Reversible logic synthesis benchmarks page. http:\/\/www.cs.uvic.ca\/~dmaslov\/.  Maslov D. 2011. Reversible logic synthesis benchmarks page. http:\/\/www.cs.uvic.ca\/~dmaslov\/."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20031202"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.836735"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.844284"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278355"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917562"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2105555"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.812318"},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the International Workshop on Boolean Problems. 37--44","author":"Miller D.","unstructured":"Miller , D. and Sasanian , Z . 2010. Improving the NCV realization of multiple-control Toffoli gates . In Proceedings of the International Workshop on Boolean Problems. 37--44 . Miller, D. and Sasanian, Z. 2010. Improving the NCV realization of multiple-control Toffoli gates. In Proceedings of the International Workshop on Boolean Problems. 37--44."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2010.48"},{"key":"e_1_2_1_76_1","volume-title":"Proceedings of the International Workshop on Logic Synthesis. 197--202","author":"Mishchenko A.","unstructured":"Mishchenko , A. and Perkowski , M . 2002. Logic synthesis of reversible wave cascades . In Proceedings of the International Workshop on Logic Synthesis. 197--202 . Mishchenko, A. and Perkowski, M. 2002. Logic synthesis of reversible wave cascades. In Proceedings of the International Workshop on Logic Synthesis. 197--202."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00191-1"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.041"},{"key":"e_1_2_1_79_1","unstructured":"M\u00f6tt\u00f6nen M. and Vartiainen J. J. 2006. Decompositions of general quantum gates. In Trends in Quantum Computing Research. NOVA Publishers Chapter 7.  M\u00f6tt\u00f6nen M. and Vartiainen J. J. 2006. Decompositions of general quantum gates. In Trends in Quantum Computing Research. NOVA Publishers Chapter 7."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.170501"},{"key":"e_1_2_1_81_1","unstructured":"Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge UK.   Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge UK."},{"key":"e_1_2_1_82_1","first-page":"3","article-title":"Optimal synthesis of linear reversible circuits","volume":"8","author":"Patel K. N.","year":"2008","unstructured":"Patel , K. N. , Markov , I. L. , and Hayes , J. P. 2008 . Optimal synthesis of linear reversible circuits . Quant. Inf. Comput. 8 , 3 -- 4 , 282--294. Patel, K. N., Markov, I. L., and Hayes, J. P. 2008. Optimal synthesis of linear reversible circuits. Quant. Inf. Comput. 8, 3--4, 282--294.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.32.3266"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.97.100501"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2005.9"},{"key":"e_1_2_1_86_1","first-page":"5945","article-title":"Shor's quantum factoring algorithm on a photonic chip","volume":"325","author":"Politi A.","year":"2009","unstructured":"Politi , A. , Matthews , J. C. F. , and O'Brien , J. L. 2009 . Shor's quantum factoring algorithm on a photonic chip . Sci. 325 , 5945 , 1221. Politi, A., Matthews, J. C. F., and O'Brien, J. L. 2009. Shor's quantum factoring algorithm on a photonic chip. Sci. 325, 5945, 1221.","journal-title":"Sci."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216396.1216399"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11080-007-9032-8"},{"key":"e_1_2_1_89_1","first-page":"3","article-title":"Block-based quantum-logic synthesis","volume":"11","author":"Saeedi M.","year":"2011","unstructured":"Saeedi , M. , Arabzadeh , M. , Saheb Zamani , M. , and Sedighi , M. 2011 a. Block-based quantum-logic synthesis . Quant. Inf. Comput. 11 , 3 -- 4 , 0262--0277. Saeedi, M., Arabzadeh, M., Saheb Zamani, M., and Sedighi, M. 2011a. Block-based quantum-logic synthesis. Quant. Inf. Comput. 11, 3--4, 0262--0277.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_90_1","volume-title":"Proceedings of the International Symposium on VLSI. 428--436","author":"Saeedi M.","unstructured":"Saeedi , M. , Saheb Zamani , M. , and Sedighi , M . 2007a. Reversible circuit synthesis using a cycle-based approach . In Proceedings of the International Symposium on VLSI. 428--436 . Saeedi, M., Saheb Zamani, M., and Sedighi, M. 2007a. Reversible circuit synthesis using a cycle-based approach. In Proceedings of the International Symposium on VLSI. 428--436."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877745.1877747"},{"key":"e_1_2_1_92_1","volume-title":"Proceedings of the International Conference on Computer-Aided Design. 65--68","author":"Saeedi M.","year":"2007","unstructured":"Saeedi , M. , Sedighi , M. , and Saheb Zamani , M. 2007 b. A novel synthesis algorithm for reversible circuits . In Proceedings of the International Conference on Computer-Aided Design. 65--68 . Saeedi, M., Sedighi, M., and Saheb Zamani, M. 2007b. A novel synthesis algorithm for reversible circuits. In Proceedings of the International Conference on Computer-Aided Design. 65--68."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2010.02.002"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_2_1_96_1","first-page":"5","article-title":"On the CNOT-cost of TOFFOLI gates","volume":"9","author":"Shende V. V.","year":"2009","unstructured":"Shende , V. V. and Markov , I. L. 2009 . On the CNOT-cost of TOFFOLI gates . Quant. Inf. Comput. 9 , 5 -- 6 , 461--486. Shende, V. V. and Markov, I. L. 2009. On the CNOT-cost of TOFFOLI gates. Quant. Inf. Comput. 9, 5--6, 461--486.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.022320"},{"key":"e_1_2_1_100_1","volume-title":"Proceedings of the International Conference on Application-Specific Systems, Architectures, and Processors. 138--148","author":"Shi Z.","unstructured":"Shi , Z. and Lee , R. B . 2000. Bit permutation instructions for accelerating software cryptography . In Proceedings of the International Conference on Application-Specific Systems, Architectures, and Processors. 138--148 . Shi, Z. and Lee, R. B. 2000. Bit permutation instructions for accelerating software cryptography. In Proceedings of the International Conference on Application-Specific Systems, Architectures, and Processors. 138--148."},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.087901"},{"key":"e_1_2_1_102_1","unstructured":"Skoneczny M. Van Rentergem Y. and De Vos A. 2008. Reversible fourier transform chip. Mixed Des. Integr. Circ. Syst. 281--286.  Skoneczny M. Van Rentergem Y. and De Vos A. 2008. Reversible fourier transform chip. Mixed Des. Integr. Circ. Syst. 281--286."},{"key":"e_1_2_1_103_1","volume-title":"Proceedings of the Workshop on Reversible Computation. http:\/\/www.revkit.org.","author":"Soeken M.","unstructured":"Soeken , M. , Frehse , S. , Wille , R. , and Drechsler , R . 2010a. RevKit: A toolkit for reversible circuit design . In Proceedings of the Workshop on Reversible Computation. http:\/\/www.revkit.org. Soeken, M., Frehse, S., Wille, R., and Drechsler, R. 2010a. RevKit: A toolkit for reversible circuit design. In Proceedings of the Workshop on Reversible Computation. http:\/\/www.revkit.org."},{"key":"e_1_2_1_104_1","doi-asserted-by":"crossref","unstructured":"Soeken M. Wille R. Dueck G. W. and Drechsler R. 2010b. Window optimization of reversible and quantum circuits. Des. Diagnost. Elec. Circ. Syst. 341--345.  Soeken M. Wille R. Dueck G. W. and Drechsler R. 2010b. Window optimization of reversible and quantum circuits. Des. Diagnost. Elec. Circ. Syst. 341--345.","DOI":"10.1109\/DDECS.2010.5491754"},{"key":"e_1_2_1_105_1","first-page":"307","article-title":"Group theoretical aspects of reversible logic gates","volume":"5","author":"Storme L.","year":"1999","unstructured":"Storme , L. , Vos , A. D. , and Jacobs , G. 1999 . Group theoretical aspects of reversible logic gates . J. Universal Comput. Sci. 5 , 5, 307 -- 321 . Storme, L., Vos, A. D., and Jacobs, G. 1999. Group theoretical aspects of reversible logic gates. J. Universal Comput. Sci. 5, 5, 307--321.","journal-title":"J. Universal Comput. Sci."},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.4"},{"key":"e_1_2_1_107_1","first-page":"6","article-title":"A fast quantum circuit for addition with few qubits","volume":"8","author":"Takahashi Y.","year":"2008","unstructured":"Takahashi , Y. and Kunihiro , N. 2008 . A fast quantum circuit for addition with few qubits . Quant. Inf. Comput. 8 , 6 -- 7 , 636--649. Takahashi, Y. and Kunihiro, N. 2008. A fast quantum circuit for addition with few qubits. Quant. Inf. Comput. 8, 6--7, 636--649.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011725.2011732"},{"key":"e_1_2_1_109_1","first-page":"9","article-title":"Quantum addition circuits and unbounded fan-out","volume":"10","author":"Takahashi Y.","year":"2010","unstructured":"Takahashi , Y. , Tani , S. , and Kunihiro , N. 2010 . Quantum addition circuits and unbounded fan-out . Quant. Inf. Comput. 10 , 9 -- 10 , 872--890. Takahashi, Y., Tani, S., and Kunihiro, N. 2010. Quantum addition circuits and unbounded fan-out. Quant. Inf. Comput. 10, 9--10, 872--890.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_110_1","doi-asserted-by":"crossref","unstructured":"Toffoli T. 1980. Reversible computing. Tech. memo MIT\/LCS\/TM-151 MIT Lab.  Toffoli T. 1980. Reversible computing. Tech. memo MIT\/LCS\/TM-151 MIT Lab.","DOI":"10.21236\/ADA082021"},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/1126257.1126259"},{"key":"e_1_2_1_113_1","doi-asserted-by":"crossref","unstructured":"Viamontes G. Markov I. L. and Hayes J. P. 2009. Quantum Circuit Simulation. Springer.   Viamontes G. Markov I. L. and Hayes J. P. 2009. Quantum Circuit Simulation. Springer.","DOI":"10.1007\/978-90-481-3065-8"},{"key":"e_1_2_1_114_1","volume-title":"Proceedings of the International Conference on Computer-Aided Design. 69--74","author":"Viamontes G. F.","unstructured":"Viamontes , G. F. , Markov , I. L. , and Hayes , J. P . 2007. Checking equivalence of quantum circuits and states . In Proceedings of the International Conference on Computer-Aided Design. 69--74 . Viamontes, G. F., Markov, I. L., and Hayes, J. P. 2007. Checking equivalence of quantum circuits and states. In Proceedings of the International Conference on Computer-Aided Design. 69--74."},{"key":"e_1_2_1_115_1","unstructured":"Visan A. M. Polyakov A. Solanki P. S. Arya K. Denniston T. and Cooperman G. 2009. Temporal debugging using URDB. CoRR abs\/0910.5046.  Visan A. M. Polyakov A. Solanki P. S. Arya K. Denniston T. and Cooperman G. 2009. Temporal debugging using URDB. CoRR abs\/0910.5046."},{"key":"e_1_2_1_116_1","volume-title":"Theory of Self-Reproducing Automata","author":"Von Neumann J.","unstructured":"Von Neumann , J. 1966. Theory of Self-Reproducing Automata . University of Illinois Press. Von Neumann, J. 1966. Theory of Self-Reproducing Automata. University of Illinois Press."},{"key":"e_1_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"},{"key":"e_1_2_1_118_1","doi-asserted-by":"crossref","unstructured":"Wille R. and Drechsler R. 2010. Towards a Design Flow for Reversible Logic. Springer.  Wille R. and Drechsler R. 2010. Towards a Design Flow for Reversible Logic. Springer.","DOI":"10.1007\/978-90-481-9579-4"},{"key":"e_1_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2009.19"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2008.43"},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403620"},{"key":"e_1_2_1_122_1","volume-title":"Proceedings of the Forum on Specification and Design Languages.","author":"Wille R.","unstructured":"Wille , R. , Offermann , S. , and Drechsler , R . 2010a. SyReC: A programming language for synthesis of reversible circuits . In Proceedings of the Forum on Specification and Design Languages. Wille, R., Offermann, S., and Drechsler, R. 2010a. SyReC: A programming language for synthesis of reversible circuits. In Proceedings of the Forum on Specification and Design Languages."},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837439"},{"key":"e_1_2_1_124_1","first-page":"9","article-title":"Fast equivalence-checking for quantum circuits","volume":"9","author":"Yamashita S.","year":"2010","unstructured":"Yamashita , S. and Markov , I. L. 2010 . Fast equivalence-checking for quantum circuits . Quant. Inf. Comput. 9 , 9 -- 10 , 721--734. Yamashita, S. and Markov, I. L. 2010. Fast equivalence-checking for quantum circuits. Quant. Inf. Comput. 9, 9--10, 721--734.","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1007\/11750321_35"},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm042"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366230.1366239"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.042313"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2431211.2431220","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2431211.2431220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:19Z","timestamp":1750234699000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2431211.2431220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":128,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1145\/2431211.2431220"],"URL":"https:\/\/doi.org\/10.1145\/2431211.2431220","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]},"assertion":[{"value":"2011-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}