{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:38:19Z","timestamp":1771234699667,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 111-2221-E-011-137-MY3"],"award-info":[{"award-number":["MOST 111-2221-E-011-137-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567893","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"166-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimization of Reversible Logic Networks with Gate Sharing"],"prefix":"10.1145","author":[{"given":"Yung-Chih","family":"Chen","sequence":"first","affiliation":[{"name":"National Taiwan Univ. of Science and Tech., Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Jie","family":"Chao","sequence":"additional","affiliation":[{"name":"National Taiwan Univ. of Science and Tech., Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. Int. Symp. Multiple Valued Logic. 150--155","author":"Abdessaied N.","unstructured":"N. Abdessaied, M. Amy, M. Soeken, and R. Drechsler. 2016. Technology mapping of reversible circuits to Clifford+T quantum circuits. In Proc. Int. Symp. Multiple Valued Logic. 150--155."},{"key":"e_1_3_2_1_2_1","volume-title":"IWLS 2005 benchmark suite. https:\/\/iwls.org\/iwls2005\/benchmarks.html","author":"Albrecht C.","year":"2005","unstructured":"C. Albrecht. 2005. IWLS 2005 benchmark suite. https:\/\/iwls.org\/iwls2005\/benchmarks.html"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. Design, Automation and Test in Europe Conf.","author":"Amaru L.","unstructured":"L. Amaru, P.-E. Gaillardon, R. Wille, and G. De Micheli. 2016. Exploiting inherent characteristics of reversible circuits for faster combinational equivalence checking. In Proc. Design, Automation and Test in Europe Conf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00084-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996789"},{"key":"e_1_3_2_1_8_1","first-page":"2","article-title":"RMDDS: Reed-Muller decision diagram synthesis of reversible logic circuits","volume":"10","author":"Lin C.-C.","year":"2014","unstructured":"C.-C. Lin and N. K. Jha. Article 14, Feb. 2014. RMDDS: Reed-Muller decision diagram synthesis of reversible logic circuits. ACM J. Emerging Technol. in Comput. Systems 10, 2 (Article 14, Feb. 2014).","journal-title":"ACM J. Emerging Technol. in Comput. Systems"},{"key":"e_1_3_2_1_9_1","volume-title":"Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization. ArXiv 1508.03273","author":"Maslov D.","year":"2015","unstructured":"D. Maslov. 2015. Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization. ArXiv 1508.03273 (2015)."},{"key":"e_1_3_2_1_10_1","first-page":"4","article-title":"Techniques for the synthesis of reversible Toffoli networks","volume":"12","author":"Maslov D.","year":"2007","unstructured":"D. Maslov, G. W. Dueck, and D. M. Miller. Sep. 2007. Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Design Autom. Electr. Syst. 12, 4 (Sep. 2007).","journal-title":"ACM Trans. Design Autom. Electr. Syst."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Quantum Physics and Logic.","author":"Meuli G.","unstructured":"G. Meuli, M. Soeken, M. Roetteler, and G. De Micheli. 2019. ROS: Resource Constrained Oracle Synthesis for Quantum Computers. In Proc. Quantum Physics and Logic."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. Design Autom. Conf. 318--323","author":"Miller D. M.","unstructured":"D. M. Miller, D. Maslov, and G. W. Dueck. 2003. A transformation based algorithm for reversible logic synthesis. In Proc. Design Autom. Conf. 318--323."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. Int. Symp. Multiple Valued Logic. 217--222","author":"Miller D. M.","unstructured":"D. M. Miller, R. Wille, and Z. Sasanian. 2011. Elementary quantum gate realizations for multiple-control Toffolli gates. In Proc. Int. Symp. Multiple Valued Logic. 217--222."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. Int. Conf. on Computer-Aided Design. 354--361","author":"Mishchenko A.","unstructured":"A. Mishchenko, S. Cho, S. Chatterjee, and R. K. Brayton. 2007. Combinational and sequential mapping with priority cuts. In Proc. Int. Conf. on Computer-Aided Design. 354--361."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. Reed Muller Workshop.","author":"Mishchenko A.","unstructured":"A. Mishchenko and M. A. Perkowski. 2001. Fast heuristic minimization of exclusive-sums-of-products. In Proc. Reed Muller Workshop."},{"key":"e_1_3_2_1_16_1","unstructured":"M. A. Nielsen and I. L. Chuang. 2010. Quantum computation and quantum information: 10th anniversary edition. Cambridge University Press Cambridge."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20860-2_20"},{"key":"e_1_3_2_1_18_1","volume-title":"Quantum circuits of T-depth one. ArXiv 1210.0974","author":"Selinger P.","year":"2013","unstructured":"P. Selinger. 2013. Quantum circuits of T-depth one. ArXiv 1210.0974 (2013)."},{"key":"e_1_3_2_1_19_1","unstructured":"M. Soeken. 2018. RevKit - A toolkit for reversible circuit design. https:\/\/github.com\/msoeken\/cirkit\/tree\/develop\/"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. Design Autom. Conf.","author":"Soeken M.","unstructured":"M. Soeken and A. Chattopadhyay. 2016. Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis. In Proc. Design Autom. Conf."},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. Design, Automation and Test in Europe Conf. 470--475","author":"Soeken M.","unstructured":"M. Soeken, M. Roetteler, N. Wiebe, and G. De Micheli. 2017. Design automation and design space exploration for quantum computers. In Proc. Design, Automation and Test in Europe Conf. 470--475."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859251"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. Soeken L. Tague G. W. Dueck and R. Drechsler. Mar. 2016. Ancilla-free synthesis of large reversible functions using binary decision diagrams. Journal of Symbolic Computation 73 (Mar. 2016) 1--26.","DOI":"10.1016\/j.jsc.2015.03.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA082021"}],"event":{"name":"ASPDAC '23: 28th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEICE","IEEE CAS","IPSJ"]},"container-title":["Proceedings of the 28th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T16:24:20Z","timestamp":1769012660000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":24,"alternative-id":["10.1145\/3566097.3567893","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567893","relation":{},"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"2023-01-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}