{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:24:40Z","timestamp":1778495080122,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":47,"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"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101001318"],"award-info":[{"award-number":["101001318"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530480","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"517-522","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Equivalence checking paradigms in quantum circuit design"],"prefix":"10.1145","author":[{"given":"Tom","family":"Peham","sequence":"first","affiliation":[{"name":"Technical University of Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Burgholzer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_1_2_1","volume-title":"of the ACM","author":"Grover L. K.","year":"1996","unstructured":"L. K. Grover, \"A fast quantum mechanical algorithm for database search,\" Proc. of the ACM, 1996."},{"key":"e_1_3_2_1_3_1","author":"Shor P. W.","year":"1997","unstructured":"P. W. Shor, \"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,\" SIAM J. Comput., 1997.","journal-title":"J. Comput."},{"key":"e_1_3_2_1_4_1","volume-title":"Variational quantum algorithms","author":"Cerezo M.","year":"2020","unstructured":"M. Cerezo et al., Variational quantum algorithms, 2020. arXiv: 2012.09265."},{"key":"e_1_3_2_1_5_1","volume-title":"Technol.","author":"Sivarajah S.","year":"2020","unstructured":"S. Sivarajah et al., \"T|ket>: A retargetable compiler for NISQ devices,\" Quantum Sci. Technol., 2020."},{"key":"e_1_3_2_1_6_1","volume-title":"Technol.","author":"Amy M.","year":"2020","unstructured":"M. Amy and V. Gheorghiu, \"Staq---A full-stack quantum processing toolkit,\" Quantum Sci. Technol., 2020."},{"key":"e_1_3_2_1_7_1","volume-title":"A quantum computational compiler and design tool for technology-specific targets,\" in Int'l Symp. on Computer Architecture","author":"Smith K. N.","year":"2019","unstructured":"K. N. Smith and M. A. Thornton, \"A quantum computational compiler and design tool for technology-specific targets,\" in Int'l Symp. on Computer Architecture, 2019."},{"key":"e_1_3_2_1_8_1","volume-title":"Technol.","author":"H\u00e4ner T.","year":"2018","unstructured":"T. H\u00e4ner et al., \"A software methodology for compiling quantum programs,\" Quantum Sci. Technol., 2018."},{"key":"e_1_3_2_1_9_1","volume-title":"Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures,\" in Int'l Conf. of Reversible Computation","author":"Hattori W.","year":"2018","unstructured":"W. Hattori and S. Yamashita, \"Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures,\" in Int'l Conf. of Reversible Computation, 2018."},{"key":"e_1_3_2_1_10_1","volume-title":"Window optimization of reversible and quantum circuits,\" in 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems","author":"Soeken M.","year":"2010","unstructured":"M. Soeken et al., \"Window optimization of reversible and quantum circuits,\" in 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, 2010."},{"key":"e_1_3_2_1_11_1","volume-title":"Optimization of quantum circuit mapping using gate transformation and commutation,\" Integration","author":"Itoko T.","year":"2020","unstructured":"T. Itoko et al., \"Optimization of quantum circuit mapping using gate transformation and commutation,\" Integration, 2020."},{"key":"e_1_3_2_1_12_1","volume-title":"Automated optimization of large quantum circuits with continuous parameters,\" npj Quantum Inf","author":"Nam Y.","year":"2018","unstructured":"Y. Nam et al., \"Automated optimization of large quantum circuits with continuous parameters,\" npj Quantum Inf, 2018."},{"key":"e_1_3_2_1_13_1","author":"Janzing D.","year":"2005","unstructured":"D. Janzing et al., \"\"Non-identity check\" is QMA-complete,\" Int. J. Quantum Inform., 2005.","journal-title":"Int. J. Quantum Inform."},{"key":"e_1_3_2_1_14_1","volume-title":"Fast equivalence-checking for quantum circuits,\" in Int'l Symp. on Nanoscale Architectures","author":"Yamashita S.","year":"2010","unstructured":"S. Yamashita and I. L. Markov, \"Fast equivalence-checking for quantum circuits,\" in Int'l Symp. on Nanoscale Architectures, 2010."},{"key":"e_1_3_2_1_15_1","volume-title":"Towards a SAT encoding for quantum circuits: A journey from classical circuits to Clifford circuits and beyond","author":"Berent L.","year":"2022","unstructured":"L. Berent et al., Towards a SAT encoding for quantum circuits: A journey from classical circuits to Clifford circuits and beyond, 2022. arXiv: 2203.00698."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586214"},{"key":"e_1_3_2_1_17_1","volume-title":"Checking equivalence of quantum circuits and states,\" in Int'l Conf. on CAD","author":"Viamontes G. F.","year":"2007","unstructured":"G. F. Viamontes et al., \"Checking equivalence of quantum circuits and states,\" in Int'l Conf. on CAD, 2007."},{"key":"e_1_3_2_1_18_1","volume-title":"A generic compilation strategy for the unitary coupled cluster ansatz","author":"Cowtan A.","year":"2020","unstructured":"A. Cowtan et al., A generic compilation strategy for the unitary coupled cluster ansatz, 2020. arXiv: 2007.10515."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"M. Amy \"Towards large-scale functional verification of universal quantum circuits \" in International Conference on Quantum Physics and Logic 2019.","DOI":"10.4204\/EPTCS.287.1"},{"key":"e_1_3_2_1_20_1","volume-title":"Advanced equivalence checking for quantum circuits,\" IEEE Trans. on CAD of Integrated Circuits and Systems","author":"Burgholzer L.","year":"2021","unstructured":"L. Burgholzer and R. Wille, \"Advanced equivalence checking for quantum circuits,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2021."},{"key":"e_1_3_2_1_21_1","author":"Wang S.-A.","year":"2008","unstructured":"S.-A. Wang et al., \"An XQDD-based verification method for quantum circuits,\" in IEICE Trans. Fundamentals, 2008.","journal-title":"Trans. Fundamentals"},{"key":"e_1_3_2_1_22_1","volume-title":"Gate-level simulation of quantum circuits,\" in Asia and South Pacific Design Automation Conf","author":"Viamontes G. F.","year":"2003","unstructured":"G. F. Viamontes et al., \"Gate-level simulation of quantum circuits,\" in Asia and South Pacific Design Automation Conf., 2003."},{"key":"e_1_3_2_1_23_1","author":"Niemann P.","year":"2016","unstructured":"P. Niemann et al., \"QMDDs: Efficient quantum function representation and manipulation,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2016.","journal-title":"Trans. on CAD of Integrated Circuits and Systems"},{"key":"e_1_3_2_1_24_1","volume-title":"QMDD: A decision diagram structure for reversible and quantum circuits,\" in Int'l Symp. on Multi-Valued Logic","author":"Miller D.","year":"2006","unstructured":"D. Miller and M. Thornton, \"QMDD: A decision diagram structure for reversible and quantum circuits,\" in Int'l Symp. on Multi-Valued Logic, 2006."},{"key":"e_1_3_2_1_25_1","volume-title":"Advanced simulation of quantum computations,\" IEEE Trans. on CAD of Integrated Circuits and Systems","author":"Zulehner A.","year":"2019","unstructured":"A. Zulehner and R. Wille, \"Advanced simulation of quantum computations,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2019."},{"key":"e_1_3_2_1_26_1","volume-title":"How to efficiently handle complex values? Implementing decision diagrams for quantum computing,\" in Int'l Conf. on CAD","author":"Zulehner A.","year":"2019","unstructured":"A. Zulehner et al., \"How to efficiently handle complex values? Implementing decision diagrams for quantum computing,\" in Int'l Conf. on CAD, 2019."},{"key":"e_1_3_2_1_27_1","volume-title":"ZX-calculus for the working quantum computer scientist","author":"van de Wetering J.","year":"2020","unstructured":"J. van de Wetering, ZX-calculus for the working quantum computer scientist, 2020. arXiv: 2012.13966."},{"key":"e_1_3_2_1_28_1","volume-title":"Graph-theoretic simplification of quantum circuits with the ZX-calculus","author":"Duncan R.","year":"2019","unstructured":"R. Duncan et al., Graph-theoretic simplification of quantum circuits with the ZX-calculus, 2019. arXiv: 1902.03178."},{"key":"e_1_3_2_1_29_1","author":"Kissinger A.","year":"2020","unstructured":"A. Kissinger and J. van de Wetering, \"Reducing T-count with the ZX-calculus,\" Phys. Rev. A, 2020.","journal-title":"Phys. Rev. A"},{"key":"e_1_3_2_1_30_1","volume-title":"Going beyond Bell's theorem","author":"Greenberger D. M.","year":"2007","unstructured":"D. M. Greenberger et al., Going beyond Bell's theorem, 2007. arXiv: 0712.0921."},{"key":"e_1_3_2_1_31_1","author":"Vidal G.","year":"2004","unstructured":"G. Vidal and C. M. Dawson, \"Universal quantum circuit for two-qubit transformations with three controlled-NOT gates,\" Phys. Rev. A, 2004.","journal-title":"Rev. A"},{"key":"e_1_3_2_1_32_1","volume-title":"Rev A","author":"Barenco A.","year":"1995","unstructured":"A. Barenco et al., \"Elementary gates for quantum computation,\" Phys. Rev A, 1995."},{"key":"e_1_3_2_1_33_1","author":"Maslov D.","year":"2016","unstructured":"D. Maslov, \"On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization,\" Phys. Rev. A, 2016.","journal-title":"Phys. Rev. A"},{"key":"e_1_3_2_1_34_1","volume-title":"Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations,\" in Design Automation Conf","author":"Wille R.","year":"2019","unstructured":"R. Wille et al., \"Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations,\" in Design Automation Conf., 2019."},{"key":"e_1_3_2_1_35_1","volume-title":"Noise-adaptive compiler mappings for Noisy Intermediate-Scale Quantum computers,\" in Int'l Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Murali P.","year":"2019","unstructured":"P. Murali et al., \"Noise-adaptive compiler mappings for Noisy Intermediate-Scale Quantum computers,\" in Int'l Conf. on Architectural Support for Programming Languages and Operating Systems, 2019."},{"key":"e_1_3_2_1_36_1","volume-title":"Tackling the qubit mapping problem for NISQ-era quantum devices,\" in Int'l Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Li G.","year":"2019","unstructured":"G. Li et al., \"Tackling the qubit mapping problem for NISQ-era quantum devices,\" in Int'l Conf. on Architectural Support for Programming Languages and Operating Systems, 2019."},{"key":"e_1_3_2_1_37_1","volume-title":"Automation and Test in Europe","author":"Wille R.","year":"2021","unstructured":"R. Wille et al., \"Visualizing decision diagrams for quantum computing,\" in Design, Automation and Test in Europe, 2021."},{"key":"e_1_3_2_1_38_1","volume-title":"Verifying results of the IBM Qiskit quantum circuit compilation flow,\" in Int'l Conf. on Quantum Computing and Engineering","author":"Burgholzer L.","year":"2020","unstructured":"L. Burgholzer et al., \"Verifying results of the IBM Qiskit quantum circuit compilation flow,\" in Int'l Conf. on Quantum Computing and Engineering, 2020."},{"key":"e_1_3_2_1_39_1","volume-title":"Picturing quantum processes,\" in Diagrammatic Representation and Inference","author":"Coecke B.","year":"2018","unstructured":"B. Coecke and A. Kissinger, \"Picturing quantum processes,\" in Diagrammatic Representation and Inference, 2018."},{"key":"e_1_3_2_1_40_1","volume-title":"There and back again: A circuit extraction tale,\" Quantum","author":"Backens M.","year":"2021","unstructured":"M. Backens et al., \"There and back again: A circuit extraction tale,\" Quantum, 2021."},{"key":"e_1_3_2_1_41_1","volume-title":"The ZX-calculus is complete for stabilizer quantum mechanics","author":"Backens M.","year":"2013","unstructured":"M. Backens, The ZX-calculus is complete for stabilizer quantum mechanics, 2013. arXiv: 1307.7025."},{"key":"e_1_3_2_1_42_1","volume-title":"A near-optimal axiomatisation of ZX-calculus for pure qubit quantum mechanics","author":"Vilmart R.","year":"2018","unstructured":"R. Vilmart, A near-optimal axiomatisation of ZX-calculus for pure qubit quantum mechanics, 2018. arXiv: 1812.09114."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415746"},{"key":"e_1_3_2_1_44_1","volume-title":"Large scale automated diagrammatic reasoning,\" presented at the Quantum Physics and Logic","author":"Kissinger A.","year":"2019","unstructured":"A. Kissinger and J. van de Wetering, \"PyZX: Large scale automated diagrammatic reasoning,\" presented at the Quantum Physics and Logic, 2019."},{"key":"e_1_3_2_1_45_1","volume-title":"Random stimuli generation for the verification of quantum circuits,\" in Asia and South Pacific Design Automation Conf","author":"Burgholzer L.","year":"2021","unstructured":"L. Burgholzer et al., \"Random stimuli generation for the verification of quantum circuits,\" in Asia and South Pacific Design Automation Conf., 2021."},{"key":"e_1_3_2_1_46_1","volume-title":"RevLib: An online resource for reversible functions and reversible circuits,\" in Int'l Symp. on Multi-Valued Logic","author":"Wille R.","year":"2008","unstructured":"R. Wille et al., \"RevLib: An online resource for reversible functions and reversible circuits,\" in Int'l Symp. on Multi-Valued Logic, 2008."},{"key":"e_1_3_2_1_47_1","volume-title":"OpenQASM 3: A broader and deeper quantum assembly language","author":"A.","year":"2021","unstructured":"A. W Cross et al., OpenQASM 3: A broader and deeper quantum assembly language, 2021. arXiv: 2104.14722."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","location":"San Francisco California","acronym":"DAC '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"]},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530480","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:17Z","timestamp":1750186937000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530480"}},"subtitle":["a case study"],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":47,"alternative-id":["10.1145\/3489517.3530480","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530480","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"}}]}}