{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T21:13:49Z","timestamp":1770153229027,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T00:00:00Z","timestamp":1673740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,15]]},"DOI":"10.1145\/3571786.3573018","type":"proceedings-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T13:52:15Z","timestamp":1673531535000},"page":"14-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Symbolic Execution of Hadamard-Toffoli Quantum Circuits"],"prefix":"10.1145","author":[{"given":"Jacques","family":"Carette","sequence":"first","affiliation":[{"name":"McMaster University, Canada"}]},{"given":"Gerardo","family":"Ortiz","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Deutsch-Jozsa problem: de-quantization and entanglement. Natural Computing, 11","author":"Abbott Alastair A.","year":"2012","unstructured":"Alastair A. Abbott . 2012. The Deutsch-Jozsa problem: de-quantization and entanglement. Natural Computing, 11 ( 2012 ). Alastair A. Abbott. 2012. The Deutsch-Jozsa problem: de-quantization and entanglement. Natural Computing, 11 (2012)."},{"key":"e_1_3_2_1_2_1","unstructured":"D. Aharonov. 2003. A simple proof that Toffoli and Hadamard are qauntum universal. arXiv:quant-ph\/0301040. \t\t\t\t  D. Aharonov. 2003. A simple proof that Toffoli and Hadamard are qauntum universal. arXiv:quant-ph\/0301040."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73473-4_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.287.1"},{"key":"e_1_3_2_1_5_1","volume-title":"Svore","author":"Amy Matthew","year":"2017","unstructured":"Matthew Amy , Martin Roetteler , and Krysta M . Svore . 2017 . Verified Compilation of Space-Efficient Reversible Circuits. In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing , Cham. 3\u201321. isbn:978-3-319-63390-9 Matthew Amy, Martin Roetteler, and Krysta M. Svore. 2017. Verified Compilation of Space-Efficient Reversible Circuits. In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing, Cham. 3\u201321. isbn:978-3-319-63390-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182657"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3390\/sym13040586"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_1_9_1","first-page":"9","article-title":"Improved Quantum Ternary Arithmetic. Quantum Info","volume":"16","author":"Bocharov Alex","year":"2016","unstructured":"Alex Bocharov , Shawn X. Cui , Martin Roetteler , and Krysta M. Svore . 2016 . Improved Quantum Ternary Arithmetic. Quantum Info . Comput. , 16 , 9 \u2013 10 (2016), jul, 862\u2013884. issn:1533-7146 Alex Bocharov, Shawn X. Cui, Martin Roetteler, and Krysta M. Svore. 2016. Improved Quantum Ternary Arithmetic. Quantum Info. Comput., 16, 9\u201310 (2016), jul, 862\u2013884. issn:1533-7146","journal-title":"Comput."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/390016.808445"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/5\/146"},{"key":"e_1_3_2_1_12_1","first-page":"231","article-title":"Simpler Methods for Generating Better Boolean Functions with Good Cryptographic Properties","volume":"29","author":"Burnett Linda","year":"2004","unstructured":"Linda Burnett , William Millan , Edward Dawson , and Andrew Clark . 2004 . Simpler Methods for Generating Better Boolean Functions with Good Cryptographic Properties . Australasian Journal of Combinatorics , 29 (2004), 231 \u2013 247 . https:\/\/eprints.qut.edu.au\/21763\/ Linda Burnett, William Millan, Edward Dawson, and Andrew Clark. 2004. Simpler Methods for Generating Better Boolean Functions with Good Cryptographic Properties. Australasian Journal of Combinatorics, 29 (2004), 231\u2013247. https:\/\/eprints.qut.edu.au\/21763\/","journal-title":"Australasian Journal of Combinatorics"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021974990700292X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_1_15_1","unstructured":"Jacques Carette Gerardo Ortiz and Amr Sabry. 2022. Retrodictive Quantum Computing. arXiv:2205.06346. \t\t\t\t  Jacques Carette Gerardo Ortiz and Amr Sabry. 2022. Retrodictive Quantum Computing. arXiv:2205.06346."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800191.805647"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_18_1","unstructured":"D. Coppersmith. 2002. An approximate Fourier transform useful in quantum factoring.  arXiv:quant-ph\/0201067 \t\t\t\t  D. Coppersmith. 2002. An approximate Fourier transform useful in quantum factoring.  arXiv:quant-ph\/0201067"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. R. Soc. Lond. A 400","author":"Deutsch David","year":"1985","unstructured":"David Deutsch . 1985 . Quantum theory, the Church\u2013Turing principle and the universal quantum computer . Proc. R. Soc. Lond. A 400 . David Deutsch. 1985. Quantum theory, the Church\u2013Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400."},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. R. Soc. Lond. A 439","author":"Deutsch David","year":"1992","unstructured":"David Deutsch and Richard Jozsa . 1992 . Rapid solution of problems by quantum computation . Proc. R. Soc. Lond. A 439 . David Deutsch and Richard Jozsa. 1992. Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439."},{"key":"e_1_3_2_1_21_1","unstructured":"Johann Makowsky Dorit Aharonov Zeph Landau. 2006. The quantum FFT can be classically simulated.  arXiv:quant-ph\/0611156 \t\t\t\t  Johann Makowsky Dorit Aharonov Zeph Landau. 2006. The quantum FFT can be classically simulated.  arXiv:quant-ph\/0611156"},{"key":"e_1_3_2_1_22_1","volume-title":"Geller and Zhongyuan Zhou","author":"Michael","year":"2013","unstructured":"Michael R. Geller and Zhongyuan Zhou . 2013 . Factoring 51 and 85 with 8 qubits. Scientific Reports ( 3023), 3, 1 (2013). Michael R. Geller and Zhongyuan Zhou. 2013. Factoring 51 and 85 with 8 qubits. Scientific Reports (3023), 3, 1 (2013)."},{"key":"e_1_3_2_1_23_1","unstructured":"D Gottesman. 1998. The Heisenberg representation of quantum computers. 6 https:\/\/www.osti.gov\/biblio\/319738 \t\t\t\t  D Gottesman. 1998. The Heisenberg representation of quantum computers. 6 https:\/\/www.osti.gov\/biblio\/319738"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1499799.1499922"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2002.1097"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341106"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563309"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929501.1929506"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_1_33_1","volume-title":"A rational design process: How and why to fake it","author":"Parnas David Lorge","unstructured":"David Lorge Parnas and Paul C Clements . 1986. A rational design process: How and why to fake it . IEEE transactions on software engineering, 251\u2013257. David Lorge Parnas and Paul C Clements. 1986. A rational design process: How and why to fake it. IEEE transactions on software engineering, 251\u2013257."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40578-0_22"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-802318-1.00001-7"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1984.10036"},{"key":"e_1_3_2_1_39_1","first-page":"11","article-title":"Efficient Classical Simulations of Quantum Fourier Transforms and Normalizer Circuits over Abelian Groups. Quantum Info","volume":"13","author":"Den Nest Maarten Van","year":"2013","unstructured":"Maarten Van Den Nest . 2013 . Efficient Classical Simulations of Quantum Fourier Transforms and Normalizer Circuits over Abelian Groups. Quantum Info . Comput. , 13 , 11 \u2013 12 (2013), nov, 1007\u20131037. issn:1533-7146 Maarten Van Den Nest. 2013. Efficient Classical Simulations of Quantum Fourier Transforms and Normalizer Circuits over Abelian Groups. Quantum Info. Comput., 13, 11\u201312 (2013), nov, 1007\u20131037. issn:1533-7146","journal-title":"Comput."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.27.179"},{"key":"e_1_3_2_1_42_1","volume-title":"The Complexity of Boolean Functions","author":"Wegener Ingo","year":"1915","unstructured":"Ingo Wegener . 1987. The Complexity of Boolean Functions . John Wiley & Sons, Inc. , USA. isbn:047 1915 556 Ingo Wegener. 1987. The Complexity of Boolean Functions. John Wiley & Sons, Inc., USA. isbn:0471915556"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.042321"}],"event":{"name":"POPL '23: The 50th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Boston MA USA","acronym":"POPL '23","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571786.3573018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571786.3573018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:33Z","timestamp":1750182573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571786.3573018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,15]]},"references-count":43,"alternative-id":["10.1145\/3571786.3573018","10.1145\/3571786"],"URL":"https:\/\/doi.org\/10.1145\/3571786.3573018","relation":{},"subject":[],"published":{"date-parts":[[2023,1,15]]},"assertion":[{"value":"2023-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}