{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T16:30:46Z","timestamp":1778171446397,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"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":[[2025,1,20]]},"DOI":"10.1145\/3658617.3697776","type":"proceedings-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T14:32:21Z","timestamp":1741098741000},"page":"930-937","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Back-end-aware Fault-tolerant Quantum Oracle Synthesis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-6816-8903","authenticated-orcid":false,"given":"Mingfei","family":"Yu","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1312-2907","authenticated-orcid":false,"given":"Alessandro","family":"Tempia Calvino","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0229-8766","authenticated-orcid":false,"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"Microsoft Quantum, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7827-3215","authenticated-orcid":false,"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The EPFL Combinational Benchmark Suite. In International Workshop on Logic and Synthesis.","author":"Amar\u00fa Luca","year":"2015","unstructured":"Luca Amar\u00fa, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. 2015. The EPFL Combinational Benchmark Suite. In International Workshop on Logic and Synthesis."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.020342"},{"key":"e_1_3_2_1_3_1","volume-title":"Mathias Soeken, Aarthi Sundaram, and Alexander Vaschillo.","author":"Beverland Michael E.","year":"2022","unstructured":"Michael E. Beverland, Prakash Murali, Matthias Troyer, Krysta M. Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, and Alexander Vaschillo. 2022. Assessing Requirements to Scale to Practical Quantum Advantage. arXiv:2211.07629"},{"key":"e_1_3_2_1_4_1","volume-title":"Bravyi and Alexei Yu. Kitaev","author":"Sergey","year":"1998","unstructured":"Sergey B. Bravyi and Alexei Yu. Kitaev. 1998. Quantum Codes on a Lattice with Boundary. arXiv:9811052"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224082"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-06-18-74"},{"key":"e_1_3_2_1_7_1","unstructured":"Craig Gidney and N. Cody Jones. 2021. A CCCZ Gate Performed with 6 T Gates. arXiv:2106.11513"},{"key":"e_1_3_2_1_8_1","unstructured":"Daniel Gottesman. 1998. The Heisenberg Representation of Quantum Computers. In International Colloquium on Group Theoretical Methods in Physics. 32--43."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-03-05-128"},{"key":"e_1_3_2_1_10_1","unstructured":"Daniel Litinski and Naomi Nickerson. 2022. Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections. arXiv:2211.15465"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3147444"},{"key":"e_1_3_2_1_12_1","volume-title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits. In International Conference on Computer-Aided Design. 1--8.","author":"Meuli Giulia","year":"2019","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 International Conference on Computer-Aided Design. 1--8."},{"key":"e_1_3_2_1_13_1","volume-title":"Xor-And-Inverter Graphs for Quantum Compilation. In npj Quantum Information","author":"Meuli Giulia","unstructured":"Giulia Meuli, Mathias Soeken, and Giovanni De Micheli. 2022. Xor-And-Inverter Graphs for Quantum Compilation. In npj Quantum Information, Vol. 8."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105357"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.032338"},{"key":"e_1_3_2_1_17_1","unstructured":"Mathias Soeken. 2020. Determining the Multiplicative Complexity of Boolean Functions using SAT. arXiv:2005.01778"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7927103"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530626"},{"key":"e_1_3_2_1_20_1","volume-title":"Dewmini Sudara Marakkalage, and Giovanni De Micheli.","author":"Soeken Mathias","year":"2022","unstructured":"Mathias Soeken, Heinz Riener, Winston Haaswijk, Eleonora Testa, Bruno Schmitt, Giulia Meuli, Fereshte Mozafari, Siang-Yun Lee, Alessandro Tempia Calvino, Dewmini Sudara Marakkalage, and Giovanni De Micheli. 2022. The EPFL Logic Synthesis Libraries. arXiv:1805.05121v3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859251"},{"key":"e_1_3_2_1_22_1","volume-title":"Automation & Test in Europe Conference & Exhibition. 1--6.","author":"Calvino Alessandro Tempia","year":"2024","unstructured":"Alessandro Tempia Calvino and Giovanni De Micheli. 2024. Scalable Logic Rewriting using Don't Cares. In Design, Automation & Test in Europe Conference & Exhibition. 1--6."},{"key":"e_1_3_2_1_23_1","volume-title":"Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications. In Design Automation Conference. 1--6.","author":"Testa Eleonora","year":"2019","unstructured":"Eleonora Testa, Mathias Soeken, Luca Amar\u00fa, and Giovanni De Micheli. 2019. Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications. In Design Automation Conference. 1--6."},{"key":"e_1_3_2_1_24_1","volume-title":"Striving for Both Quality and Speed: Logic Synthesis for Practical Garbled Circuits. In International Conference on Computer-Aided Design. 1--9.","author":"Yu Mingfei","year":"2023","unstructured":"Mingfei Yu and Giovanni De Micheli. 2023. Striving for Both Quality and Speed: Logic Synthesis for Practical Garbled Circuits. In International Conference on Computer-Aided Design. 1--9."}],"event":{"name":"ASPDAC '25: 30th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '25","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEICE","IPSJ","IEEE CAS","IEEE CEDA"]},"container-title":["Proceedings of the 30th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697776","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658617.3697776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:53Z","timestamp":1750295873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":24,"alternative-id":["10.1145\/3658617.3697776","10.1145\/3658617"],"URL":"https:\/\/doi.org\/10.1145\/3658617.3697776","relation":{},"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"2025-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}