{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:43:14Z","timestamp":1765960994644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T00:00:00Z","timestamp":1497744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["H2020-ERC-2014-ADG 669354"],"award-info":[{"award-number":["H2020-ERC-2014-ADG 669354"]}]},{"name":"Swiss National Science Foundation","award":["200021-169084"],"award-info":[{"award-number":["200021-169084"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,18]]},"DOI":"10.1145\/3061639.3062261","type":"proceedings-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T12:18:42Z","timestamp":1497356322000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Hierarchical Reversible Logic Synthesis Using LUTs"],"prefix":"10.1145","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[{"name":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"}]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Nathan","family":"Wiebe","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2016.33"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/18\/3\/033032"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382677"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"B. D. Clader B. C. Jacobs and C. R. Sprouse. Preconditioned quantum linear system algorithm. Physical review letters 110(25):250504 2013.  B. D. Clader B. C. Jacobs and C. R. Sprouse. Preconditioned quantum linear system algorithm. Physical review letters 110(25):250504 2013.","DOI":"10.1103\/PhysRevLett.110.250504"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.273754"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2008.2.183"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature18648"},{"key":"e_1_3_2_1_12_1","unstructured":"T. Draper and S. Kutin. ⟨q|pic⟩: Creating quantum circuit diagrams in TikZ. github.com\/qpic\/qpic 2016.  T. Draper and S. Kutin. ⟨q|pic⟩: Creating quantum circuit diagrams in TikZ. github.com\/qpic\/qpic 2016."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"A. W. Harrow A. Hassidim and S. Lloyd. Quantum algorithm for linear systems of equations. Physical review letters 103(15):150502 2009.  A. W. Harrow A. Hassidim and S. Lloyd. Quantum algorithm for linear systems of equations. Physical review letters 103(15):150502 2009.","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_2_1_16_1","unstructured":"A. V. Himanshu Thapliyal Hamid R. Arabnia. Combined integer and floating point multiplication architecture (CIFM) for FPGAs and its reversible logic implementation. arxiv.org\/abs\/cs\/0610090.  A. V. Himanshu Thapliyal Hamid R. Arabnia. Combined integer and floating point multiplication architecture (CIFM) for FPGAs and its reversible logic implementation. arxiv.org\/abs\/cs\/0610090."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.022328"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature18318"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1326073.1326147"},{"volume-title":"Int Reed-Muller Workshop","year":"2001","author":"Mishchenko A.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629525"},{"key":"e_1_3_2_1_25_1","unstructured":"M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge university press 2010.   M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge university press 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.031007"},{"key":"e_1_3_2_1_27_1","first-page":"1579","volume-title":"DATE","author":"Ray S.","year":"2012"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898107"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40578-0_22"},{"issue":"1","key":"e_1_3_2_1_30_1","first-page":"55","article-title":"RevKit: A toolkit for reversible circuit design","volume":"18","author":"Soeken M.","year":"2012","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IDT.2010.5724427"},{"key":"e_1_3_2_1_32_1","unstructured":"N. Wiebe and M. Roetteler. Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits. arXiv:1406.2040.  N. Wiebe and M. Roetteler. Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits. arXiv:1406.2040."}],"event":{"name":"DAC '17: The 54th Annual Design Automation Conference 2017","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Austin TX USA","acronym":"DAC '17"},"container-title":["Proceedings of the 54th Annual Design Automation Conference 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061639.3062261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3061639.3062261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:35Z","timestamp":1750217795000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061639.3062261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,18]]},"references-count":32,"alternative-id":["10.1145\/3061639.3062261","10.1145\/3061639"],"URL":"https:\/\/doi.org\/10.1145\/3061639.3062261","relation":{},"subject":[],"published":{"date-parts":[[2017,6,18]]},"assertion":[{"value":"2017-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}