{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T18:46:44Z","timestamp":1767811604554,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":17,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567935","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"696-701","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Robust Approach to Detecting Non-Equivalent Quantum Circuits Using Specially Designed Stimuli"],"prefix":"10.1145","author":[{"given":"Hsiao-Lun","family":"Liu","sequence":"first","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Ting","family":"Li","sequence":"additional","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung-Chih","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yao","family":"Wang","sequence":"additional","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Improved DD-based Equivalence Checking of Quantum Circuits","author":"Burgholzer L.","year":"2020","unstructured":"L. Burgholzer and R. Wille, \"Improved DD-based Equivalence Checking of Quantum Circuits,\" in Proc. of ASP-DAC, 2020, pp. 1--6.","journal-title":"Proc. of ASP-DAC"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"The Power of Simulation for Equivalence Checking in Quantum Computing","author":"Burgholzer L.","year":"2020","unstructured":"L. Burgholzer and R. Wille, \"The Power of Simulation for Equivalence Checking in Quantum Computing,\" in Proc. of DAC, 2020, pp. 1--6.","journal-title":"Proc. of DAC"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Threshold-Based Quantum Optimization","author":"Golden J.","year":"2021","unstructured":"J. Golden, A. Bartschi, D. O'Malley, and S. Eidenbenz, \"Threshold-Based Quantum Optimization,\" in Proc. of QCE, 2021, pp. 1--11.","journal-title":"Proc. of QCE"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99498-7_16"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation","author":"Hillmich S.","year":"2021","unstructured":"S. Hillmich, R. Kueng, I. L. Markov, and R. Wille, \"As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation,\" in Proc. of DATE, 2021, pp. 1--6.","journal-title":"Proc. of DATE"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"The role of multiplicative complexity in compiling low T-count oracle circuits","author":"Meuli G.","year":"2019","unstructured":"G. Meuli, M. Soeken, E. Campbell, M. Roetteler, and G. De. Micheli, \"The role of multiplicative complexity in compiling low T-count oracle circuits,\" in Proc. of ICCAD, 2019, pp. 1--8.","journal-title":"Proc. of ICCAD"},{"key":"e_1_3_2_1_7_1","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition,\" Cambridge University Press","author":"Nielsen M. A.","year":"2010","unstructured":"M. A. Nielsen and I. L. Chuang, \"Quantum Computation and Quantum Information: 10th Anniversary Edition,\" Cambridge University Press, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2459034"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Multistart Methods for Quantum Approximate Optimization","author":"Shaydulin R.","year":"2019","unstructured":"R. Shaydulin, I. Safro, and J. Larson, \"Multistart Methods for Quantum Approximate Optimization,\" Proc. of HPEC, 2019, pp. 1--8.","journal-title":"Proc. of HPEC"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Reducing the multiplicative complexity in logic networks for cryptography and security applications","author":"Testa E.","year":"2019","unstructured":"E. Testa, M. Soeken, L. Amaru and G. De. Micheli, \"Reducing the multiplicative complexity in logic networks for cryptography and security applications,\" in Proc. of DAC, 2019, pp. 1--6.","journal-title":"Proc. of DAC"},{"key":"e_1_3_2_1_11_1","first-page":"568","article-title":"A logic synthesis toolbox for reducing the multiplicative complexity in logic networks","author":"Testa E.","year":"2020","unstructured":"E. Testa, M. Soeken, H. Riener, L. Amaru and G. De. Micheli, \"A logic synthesis toolbox for reducing the multiplicative complexity in logic networks,\" in Proc. of DATE, 2020, pp. 568--573.","journal-title":"Proc. of DATE"},{"key":"e_1_3_2_1_12_1","first-page":"220","article-title":"RevLib: An online resource for reversible functions and reversible circuits","author":"Wille R.","year":"2008","unstructured":"R. Wille, D. Gro\u00dfe, L. Teuber, G. W. Dueck, and R. Drechsler, \"RevLib: An online resource for reversible functions and reversible circuits,\" in Int'l Symp. on Multi-Valued Logic, 2008, pp. 220--225.","journal-title":"Int'l Symp. on Multi-Valued Logic"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Efficient and Correct Compilation of Quantum Circuits","author":"Wille R.","year":"2020","unstructured":"R. Wille, S. Hillmich, and L. Burgholzer, \"Efficient and Correct Compilation of Quantum Circuits,\" in Proc. of ISCAS, 2020, pp. 1--5.","journal-title":"Proc. of ISCAS"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834427"},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing","author":"Zulehner A.","year":"2019","unstructured":"A. Zulehner, S. Hillmich, and R. Wille, \"How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing,\" in Proc. of ICCAD, 2019, pp. 1--7.","journal-title":"Proc. of ICCAD"},{"key":"e_1_3_2_1_16_1","unstructured":"\"Qiskit \" IBM [Online]. Available: https:\/\/qiskit.org\/."},{"key":"e_1_3_2_1_17_1","unstructured":"\"QDK \" Microsoft [Online]. Available: https:\/\/github.com\/microsoft\/qdk-python."}],"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.3567935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T17:36:11Z","timestamp":1767807371000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":17,"alternative-id":["10.1145\/3566097.3567935","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567935","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"}}]}}