{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:21:15Z","timestamp":1778494875383,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":42,"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":[{"name":"Munich Quantum Valley"},{"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.3530627","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"1367-1370","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The basis of design tools for quantum computing"],"prefix":"10.1145","author":[{"given":"Robert","family":"Wille","sequence":"first","affiliation":[{"name":"Technical University of Munich, Germany and Software Competence Center Hagenberg (SCCH) GmbH, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Burgholzer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Hillmich","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Grurl","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Ploier","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Peham","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Austria"}],"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.1137\/S0097539795293172"},{"key":"e_1_3_2_1_2_1","volume-title":"Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,\" Nature","author":"Kandala A.","unstructured":"A. Kandala, A. Mezzacapo, et al., \"Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,\" Nature, vol. 549, no. 7671, 2017."},{"key":"e_1_3_2_1_3_1","volume-title":"Biology and medicine in the landscape of quantum advantages","author":"Cordier B. A.","year":"2021","unstructured":"B. A. Cordier, N. P. D. Sawaya, G. G. Guerreschi, and S. K. McWeeney, Biology and medicine in the landscape of quantum advantages, 2021. arXiv: 2112.00760."},{"key":"e_1_3_2_1_4_1","volume-title":"Quantum computational advantage using photons,\" Science","author":"Zhong H.-S.","unstructured":"H.-S. Zhong, H. Wang, et al., \"Quantum computational advantage using photons,\" Science, vol. 370, no. 6523, 2020."},{"key":"e_1_3_2_1_5_1","volume-title":"A survey of quantum computing for finance","author":"Herman D.","year":"2022","unstructured":"D. Herman, C. Googin, et al., A survey of quantum computing for finance, 2022. arXiv: 2201.02773."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.abk3333"},{"key":"e_1_3_2_1_7_1","unstructured":"J. Gambetta \"IBM's Roadmap For Scaling Quantum Technology \" IBM Research Blog 2020. [Online]. Available: https:\/\/www.ibm.com\/blogs\/research\/2020\/09\/ibm-quantum-roadmap\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1823458"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834427"},{"key":"e_1_3_2_1_10_1","volume-title":"QuEST and high performance simulation of quantum computers,\" in Scientific Reports","author":"Jones T.","year":"2018","unstructured":"T. Jones, A. Brown, I. Bush, and S. C. Benjamin, \"QuEST and high performance simulation of quantum computers,\" in Scientific Reports, 2018."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.116.250501"},{"key":"e_1_3_2_1_12_1","volume-title":"Automation and Test in Europe","author":"Hillmich S.","year":"2020","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 Design, Automation and Test in Europe, 2020."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3182628"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"},{"key":"e_1_3_2_1_16_1","volume-title":"A software methodology for compiling quantum programs,\" Quantum Sci. Technol","author":"H\u00e4ner T.","unstructured":"T. H\u00e4ner, D. S. Steiger, K. Svore, and M. Troyer, \"A software methodology for compiling quantum programs,\" Quantum Sci. Technol., vol. 3, no. 2, 2018."},{"key":"e_1_3_2_1_17_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_18_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_19_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_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3032630"},{"key":"e_1_3_2_1_21_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, I. L. Markov, and J. P. Hayes, \"Checking equivalence of quantum circuits and states,\" in Int'l Conf. on CAD, 2007."},{"key":"e_1_3_2_1_22_1","volume-title":"Equivalence checking in multi-level quantum systems,\" in Int'l Conf. of Reversible Computation","author":"Niemann P.","year":"2014","unstructured":"P. Niemann, R. Wille, and R. Drechsler, \"Equivalence checking in multi-level quantum systems,\" in Int'l Conf. of Reversible Computation, 2014."},{"key":"e_1_3_2_1_23_1","volume-title":"Fundamentals","author":"Wang S.-A.","year":"2008","unstructured":"S.-A. Wang, C.-Y. Lu, I.-M. Tsai, and S.-Y. Kuo, \"An XQDD-based verification method for quantum circuits,\" in IEICE Trans. Fundamentals, 2008."},{"key":"e_1_3_2_1_24_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_25_1","volume-title":"A tensor network based decision diagram for representation of quantum circuits","author":"Hong X.","year":"2020","unstructured":"X. Hong, X. Zhou, et al., A tensor network based decision diagram for representation of quantum circuits, 2020. arXiv: 2009.02618."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_1_27_1","volume-title":"Massively parallel quantum computer simulator, eleven years later,\" Computer Physics Communications","author":"De Raedt H.","year":"2019","unstructured":"H. De Raedt et al., \"Massively parallel quantum computer simulator, eleven years later,\" Computer Physics Communications, vol. 237, 2019."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2459034"},{"key":"e_1_3_2_1_29_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_30_1","volume-title":"Automation and Test in Europe","author":"Wille R.","year":"2021","unstructured":"R. Wille, L. Burgholzer, and M. Artner, \"Visualizing decision diagrams for quantum computing,\" in Design, Automation and Test in Europe, 2021."},{"key":"e_1_3_2_1_31_1","volume-title":"Finitely correlated states on quantum spin chains,\" Commun. Math. Phys","author":"Fannes M.","unstructured":"M. Fannes, B. Nachtergaele, and R. F. Werner, \"Finitely correlated states on quantum spin chains,\" Commun. Math. Phys., vol. 144, no. 3, 1992."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa6dc3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000176"},{"key":"e_1_3_2_1_34_1","volume-title":"Hyper-optimized tensor network contraction,\" Quantum","author":"Gray J.","year":"2021","unstructured":"J. Gray and S. Kourtis, \"Hyper-optimized tensor network contraction,\" Quantum, vol. 5, 2021."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.93.045003"},{"key":"e_1_3_2_1_36_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_37_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_38_1","doi-asserted-by":"crossref","unstructured":"R. Duncan A. Kissinger S. Perdrix and J. van de Wetering \"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus \" Quantum vol. 4 2020.","DOI":"10.22331\/q-2020-06-04-279"},{"key":"e_1_3_2_1_39_1","article-title":"Reducing T-count with the ZX-calculus","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_40_1","doi-asserted-by":"crossref","unstructured":"A. Kissinger and J. van de Wetering \"Simulating quantum circuits with zx-calculus reduced stabiliser decompositions \" Quantum Science and Technology 2022.","DOI":"10.1088\/2058-9565\/ac5d20"},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. Theor. Comput. Sci.","volume":"318","author":"de Beaudrap N.","year":"2020","unstructured":"N. de Beaudrap, X. Bian, and Q. Wang, \"Techniques to reduce π\/4-parity-phase circuits, motivated by the ZX calculus,\" Electron. Proc. Theor. Comput. Sci., vol. 318, 2020."},{"key":"e_1_3_2_1_42_1","volume-title":"A generic compilation strategy for the unitary coupled cluster ansatz","author":"Cowtan A.","year":"2020","unstructured":"A. Cowtan, W. Simmons, and R. Duncan, A generic compilation strategy for the unitary coupled cluster ansatz, 2020. arXiv: 2007.10515."}],"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.3530627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:23Z","timestamp":1750186943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530627"}},"subtitle":["arrays, decision diagrams, tensor networks, and ZX-calculus"],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":42,"alternative-id":["10.1145\/3489517.3530627","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530627","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"}}]}}