{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:09:34Z","timestamp":1755839374761,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530626","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"1363-1366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Automatic oracle generation in microsoft's quantum development kit using QIR and LLVM passes"],"prefix":"10.1145","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[{"name":"Microsoft Quantum, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariia","family":"Mykhailova","sequence":"additional","affiliation":[{"name":"Microsoft Quantum"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1088\/2058-9565\/ab9359"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/TCAD.2013.2244643"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1137\/0218053"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/DAC18072.2020.9218492"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/FOCS.2015.54"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/3385412.3386007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/s00145-012-9124-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1090\/conm\/305\/05215"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/s12095-018-0297-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/237814.237866"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3501334"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1038\/s42254-020-00245-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1103\/PhysRevLett.95.050501"},{"doi-asserted-by":"publisher","unstructured":"Balagopal Komarath Jayalal Sarma and Saurabh Sawlani. 2015. Reversible Pebble Game on Trees. In Int'l Conf. on Computing and Combinatorics. 83--94. 10.1007\/978-3-319-21398-9_7","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-319-21398-9_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/TCAD.2002.804386"},{"doi-asserted-by":"publisher","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: a compilation framework for lifelong program analysis & transformation. In Int'l Symp. on Code Generation and Optimization. 10.1109\/CGO.2004.1281665","key":"e_1_3_2_1_16_1","DOI":"10.1109\/CGO.2004.1281665"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/2230996.2230997"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1103\/PhysRevA.87.012310"},{"doi-asserted-by":"publisher","unstructured":"Giulia Meuli Mathias Soeken Earl Campbell Martin Roetteler and Giovanni De Micheli. 2019. The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits. In Int'l Conf. on Computer-Aided Design. 1--8. 10.1109\/ICCAD45719.2019.8942093","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICCAD45719.2019.8942093"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1038\/s41534-021-00514-y"},{"doi-asserted-by":"publisher","unstructured":"Giulia Meuli Mathias Soeken Martin Roetteler Nikolaj Bj\u00f8rner and Giovanni De Micheli. 2019. Reversible Pebbling Game for Quantum Memory Management. In Design Automation and Test in Europe. 288--291. 10.23919\/DATE.2019.8715092","key":"e_1_3_2_1_21_1","DOI":"10.23919\/DATE.2019.8715092"},{"doi-asserted-by":"publisher","unstructured":"Mariusz Rawski. 2015. Application of Functional Decomposition in Synthesis of Reversible Circuits. In Int'l Conf. on Reversible Computation. 285--290. 10.1007\/978-3-319-20860-2_20","key":"e_1_3_2_1_22_1","DOI":"10.1007\/978-3-319-20860-2_20"},{"doi-asserted-by":"publisher","unstructured":"Claus-Peter Schnorr. 1988. The Multiplicative Complexity of Boolean Functions. In Int'l Conf. on Applied Algebra Algebraic Algorithms and Error-Correcting Codes. 45--58. 10.1007\/3-540-51083-4_47","key":"e_1_3_2_1_23_1","DOI":"10.1007\/3-540-51083-4_47"},{"key":"e_1_3_2_1_24_1","volume-title":"Determining the Multiplicative Complexity of Boolean Functions using SAT. arXiv preprint arXiv:2005.01778","author":"Soeken Mathias","year":"2020","unstructured":"Mathias Soeken. 2020. Determining the Multiplicative Complexity of Boolean Functions using SAT. arXiv preprint arXiv:2005.01778 (2020)."},{"doi-asserted-by":"publisher","unstructured":"Mathias Soeken Stefan Frehse Robert Wille and Rolf Drechsler. 2011. RevKit: An Open Source Toolkit for the Design of Reversible Circuits. In Int'l Workshop on Reversible Computation. 64--76. 10.1007\/978-3-642-29517-1_6","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-642-29517-1_6"},{"doi-asserted-by":"publisher","unstructured":"Mathias Soeken Thomas H\u00e4ner and Martin Roetteler. 2018. Programming quantum computers using design automation. In Design Automation and Test in Europe. 137--146. 10.23919\/DATE.2018.8341993","key":"e_1_3_2_1_26_1","DOI":"10.23919\/DATE.2018.8341993"},{"key":"e_1_3_2_1_27_1","volume-title":"The EPFL logic synthesis libraries. arXiv preprint arXiv:1805.05121v2","author":"Soeken Mathias","year":"2018","unstructured":"Mathias Soeken, Heinz Riener, Winston Haaswijk, Eleonora Testa, Bruno Schmitt, Giulia Meuli, Fereshte Mozafari, and Giovanni De Micheli. 2018. The EPFL logic synthesis libraries. arXiv preprint arXiv:1805.05121v2 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/TCAD.2018.2859251"},{"key":"e_1_3_2_1_29_1","volume-title":"ProjectQ: An Open Source Software Framework for Quantum Computing. arXiv preprint arXiv:1612.08091","author":"Steiger Damian S.","year":"2016","unstructured":"Damian S. Steiger, Thomas Haener, and Matthias Troyer. 2016. ProjectQ: An Open Source Software Framework for Quantum Computing. arXiv preprint arXiv:1612.08091 (2016)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/3183895.3183901"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3316781.3317893"},{"key":"e_1_3_2_1_32_1","volume-title":"Luca Gaetano Amar\u00f9, and Giovanni De Micheli","author":"Testa Eleonora","year":"2020","unstructured":"Eleonora Testa, Mathias Soeken, Heinz Riener, Luca Gaetano Amar\u00f9, and Giovanni De Micheli. 2020. A logic synthesis toolbox for reducing the multiplicative complexity in logic networks. In Design, Automation and Test in Europe."}],"event":{"sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"acronym":"DAC '22","name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","location":"San Francisco California"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530626","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:23Z","timestamp":1750186943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":32,"alternative-id":["10.1145\/3489517.3530626","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530626","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}