{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:24:38Z","timestamp":1778495078941,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":42,"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"}],"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":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567932","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"702-708","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Equivalence Checking of Parameterized Quantum Circuits"],"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 and Hagenberg GmbH, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Quantum supremacy using a programmable superconducting processor,\" Nature","author":"Arute F.","year":"2019","unstructured":"F. Arute et al., \"Quantum supremacy using a programmable superconducting processor,\" Nature, 2019."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.abe8770"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.abk3333"},{"key":"e_1_3_2_1_4_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_5_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_6_1","volume-title":"Prog. Phys.","author":"Devitt S. J.","year":"2013","unstructured":"S. J. Devitt, K. Nemoto, and W. J. Munro, \"Quantum error correction for beginners,\" Rep. Prog. Phys., 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"J. Preskill \"Quantum computing in the NISQ era and beyond \" Quantum 2018.","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_1_8_1","first-page":"2012","author":"Cerezo M.","year":"2020","unstructured":"M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, Variational quantum algorithms, 2020. arXiv: 2012.09265.","journal-title":"Variational quantum algorithms"},{"key":"e_1_3_2_1_9_1","author":"McArdle S.","year":"2020","unstructured":"S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, \"Quantum computational chemistry,\" Rev. Mod. Phys., 2020.","journal-title":"\"Quantum computational chemistry,\" Rev. Mod. Phys."},{"key":"e_1_3_2_1_10_1","author":"Egger D.","year":"2020","unstructured":"D. Egger, C. Gambella, J. Marecek, S. McFaddin, M. Mevissen, R. Raymond, A. Simonetto, S. Woerner, and E. Yndurain, \"Quantum Computing for Finance: State-of-the-Art and Future Prospects,\" IEEE Transactions on Quantum Engineering, 2020.","journal-title":"\"Quantum Computing for Finance: State-of-the-Art and Future Prospects,\" IEEE Transactions on Quantum Engineering"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"e_1_3_2_1_12_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, Y. Ding, and Y. Xie, \"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_13_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, L. Burgholzer, and A. Zulehner, \"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_14_1","volume-title":"On the complexity of quantum circuit compilation,\" in Int'l Symp. on Combinatorial Search","author":"Botea A.","year":"2018","unstructured":"A. Botea, A. Kishimoto, and R. Marinescu, \"On the complexity of quantum circuit compilation,\" in Int'l Symp. on Combinatorial Search, 2018."},{"key":"e_1_3_2_1_15_1","volume-title":"Optimal layout synthesis for quantum computing,\" in Int'l Conf. on CAD","author":"Tan B.","year":"2020","unstructured":"B. Tan and J. Cong, \"Optimal layout synthesis for quantum computing,\" in Int'l Conf. on CAD, 2020."},{"key":"e_1_3_2_1_16_1","volume-title":"Quantum circuit compilers using gate commutation rules,\" in Asia and South Pacific Design Automation Conf","author":"Itoko T.","year":"2019","unstructured":"T. Itoko, R. Raymond, T. Imamichi, A. Matsuo, and A. W. Cross, \"Quantum circuit compilers using gate commutation rules,\" in Asia and South Pacific Design Automation Conf., 2019."},{"key":"e_1_3_2_1_17_1","volume-title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits,\" IEEE Trans. on CAD of Integrated Circuits and Systems","author":"Amy M.","year":"2013","unstructured":"M. Amy, D. Maslov, M. Mosca, and M. Roetteler, \"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2013."},{"key":"e_1_3_2_1_18_1","volume-title":"An efficient methodology for mapping quantum circuits to the IBM QX architectures,\" IEEE Trans. on CAD of Integrated Circuits and Systems","author":"Zulehner A.","year":"2019","unstructured":"A. Zulehner, A. Paler, and R. Wille, \"An efficient methodology for mapping quantum circuits to the IBM QX architectures,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2019."},{"key":"e_1_3_2_1_19_1","volume-title":"Compiling SU(4) quantum circuits to IBM QX architectures,\" in Asia and South Pacific Design Automation Conf","author":"Zulehner A.","year":"2019","unstructured":"A. Zulehner and R. Wille, \"Compiling SU(4) quantum circuits to IBM QX architectures,\" in Asia and South Pacific Design Automation Conf., 2019."},{"key":"e_1_3_2_1_20_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, R. Raymond, and R. Wille, \"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_21_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_22_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_23_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_24_1","volume-title":"Accurate BDD-based Unitary Manipulation for Scalable and Robust Quantum Circuit Verification,\" in Design Automation Conf","author":"Chun-Yu W.","year":"2022","unstructured":"W. Chun-Yu, T. Yuan-Hung, J. Chaio-Shan, and J. Jie-Hong, \"Accurate BDD-based Unitary Manipulation for Scalable and Robust Quantum Circuit Verification,\" in Design Automation Conf., 2022."},{"key":"e_1_3_2_1_25_1","author":"Janzing D.","year":"2005","unstructured":"D. Janzing, P. Wocjan, and T. Beth, \"\"Non-identity check\" is QMA-complete,\" Int. J. Quantum Inform., 2005.","journal-title":"\"\"Non-identity check\" is QMA-complete,\" Int. J. Quantum Inform."},{"key":"e_1_3_2_1_26_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_27_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_28_1","volume-title":"Qiskit: An open-source framework for quantum computing,\" Zenodo","author":"Aleksandrowicz G.","year":"2019","unstructured":"G. Aleksandrowicz et al., \"Qiskit: An open-source framework for quantum computing,\" Zenodo, 2019."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_1_30_1","volume-title":"QMDDs: Efficient quantum function representation and manipulation,\" IEEE Trans. on CAD of Integrated Circuits and Systems","author":"Niemann P.","year":"2016","unstructured":"P. Niemann, R. Wille, D. M. Miller, M. A. Thornton, and R. Drechsler, \"QMDDs: Efficient quantum function representation and manipulation,\" IEEE Trans. on CAD of Integrated Circuits and Systems, 2016."},{"key":"e_1_3_2_1_31_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, S. Hillmich, and R. Wille, \"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_32_1","volume-title":"Comput.-Aided Des. Integr. Circuits Syst.","author":"Niemann P.","year":"2020","unstructured":"P. Niemann, A. Zulehner, R. Drechsler, and R. Wille, \"Overcoming the Tradeoff Between Accuracy and Compactness in Decision Diagrams for Quantum Computation,\" IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 2020."},{"key":"e_1_3_2_1_33_1","volume-title":"An applied quantum Hoare logic,\" in Conference on Programming Language Design and Implementation","author":"Zhou L.","year":"2019","unstructured":"L. Zhou, N. Yu, and M. Ying, \"An applied quantum Hoare logic,\" in Conference on Programming Language Design and Implementation, 2019."},{"key":"e_1_3_2_1_34_1","volume-title":"Structures in Comp. Sci.","author":"D'hondt E.","year":"2006","unstructured":"E. D'hondt and P. Panangaden, \"Quantum weakest preconditions,\" Mathematical. Structures in Comp. Sci., 2006."},{"key":"e_1_3_2_1_35_1","first-page":"2110","author":"Lewis M.","year":"2021","unstructured":"M. Lewis, S. Soudjani, and P. Zuliani, Formal Verification of Quantum Programs: Theory, Tools and Challenges, 2021. arXiv: 2110.01320 [quant-ph].","journal-title":"Formal Verification of Quantum Programs: Theory, Tools and Challenges"},{"key":"e_1_3_2_1_36_1","first-page":"2205","author":"Tao R.","year":"2022","unstructured":"R. Tao, Y. Shi, J. Yao, X. Li, A. Javadi-Abhari, A. W. Cross, F. T. Chong, and R. Gu, Giallar: Push-button verification for the Qiskit quantum compiler, 2022. arXiv: 2205.00661 [quant-ph].","journal-title":"Giallar: Push-button verification for the Qiskit quantum compiler"},{"key":"e_1_3_2_1_37_1","first-page":"2112","author":"Li L.","year":"2022","unstructured":"L. Li, F. Voichick, K. Hietala, Y. Peng, X. Wu, and M. Hicks, Verified Compilation of Quantum Oracles, 2022. arXiv: 2112.06700 [quant-ph].","journal-title":"Verified Compilation of Quantum Oracles"},{"key":"e_1_3_2_1_38_1","first-page":"1901","author":"Rand R.","year":"2019","unstructured":"R. Rand, J. Paykin, D.-H. Lee, and S. Zdancewic, \"ReQWIRE: Reasoning about Reversible Quantum Circuits,\" Electron. Proc. Theor. Comput. Sci., 2019. arXiv: 1901.10118 [cs].","journal-title":"\"ReQWIRE: Reasoning about Reversible Quantum Circuits,\" Electron. Proc. Theor. Comput. Sci."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530480"},{"key":"e_1_3_2_1_40_1","volume-title":"Automated optimization of large quantum circuits with continuous parameters,\" npj Quantum Inf","author":"Nam Y.","year":"2018","unstructured":"Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, \"Automated optimization of large quantum circuits with continuous parameters,\" npj Quantum Inf, 2018."},{"key":"e_1_3_2_1_41_1","volume-title":"Efficient construction of functional representations for quantum algorithms,\" in Int'l Conf. of Reversible Computation","author":"Burgholzer L.","year":"2021","unstructured":"L. Burgholzer, R. Raymond, I. Sengupta, and R. Wille, \"Efficient construction of functional representations for quantum algorithms,\" in Int'l Conf. of Reversible Computation, 2021."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595391.1595393"}],"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.3567932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T17:36:07Z","timestamp":1767807367000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567932"}},"subtitle":["Verifying the Compilation of Variational Quantum Algorithms"],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":42,"alternative-id":["10.1145\/3566097.3567932","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567932","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"}}]}}