{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:25:57Z","timestamp":1777519557710,"version":"3.51.4"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100018870","name":"Poul Due Jensen Foundation","doi-asserted-by":"crossref","award":["883901"],"award-info":[{"award-number":["883901"]}],"id":[{"id":"10.13039\/501100018870","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Villum Investigator Grant S4OS and the project SERICS","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]},{"name":"European Union - NextGenerationEU"},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["101001318"],"award-info":[{"award-number":["101001318"]}]},{"name":"Bavarian state government with funds from the Hightech Agenda Bayern Plus"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Efficient methods for the simulation of quantum circuits on classical computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation, an established class of techniques that has been proven successful for (classic) stochastic and deterministic systems such as Markov chains and ordinary differential equations. Forward constrained bisimulation yields a lower-dimensional model which exactly preserves quantum measurements projected on a linear subspace of interest. Backward constrained bisimulation gives a reduction that is valid on a subspace containing the circuit input, from which the circuit result can be fully recovered. We provide an algorithm to compute the constraint bisimulations yielding coarsest reductions in both cases, using a duality result relating the two notions. As applications, we provide theoretical bounds on the size of the reduced state space for well-known quantum algorithms for search, optimization, and factorization. Using a prototype implementation, we report significant reductions on a set of benchmarks. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude, allowing thus for substantial synergy effects.<\/jats:p>","DOI":"10.1145\/3712711","type":"journal-article","created":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T11:07:19Z","timestamp":1737198439000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4699-1316","authenticated-orcid":false,"given":"Lukas","family":"Burgholzer","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6096-0623","authenticated-orcid":false,"given":"Antonio","family":"Jimenez-Pastor","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5953-3384","authenticated-orcid":false,"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[{"name":"Aalborg Universitet, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6018-5989","authenticated-orcid":false,"given":"Mirco","family":"Tribastone","sequence":"additional","affiliation":[{"name":"IMT School for Advanced Studies Lucca, Lucca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6186-8669","authenticated-orcid":false,"given":"Max","family":"Tschaikowski","sequence":"additional","affiliation":[{"name":"Computer Science, Aalborg Universitet, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-7860","authenticated-orcid":false,"given":"Robert","family":"Wille","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munchen, Germany and Software Competence Center Hagenberg GmbH, Hagenberg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"issue":"5","key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"052328","DOI":"10.1103\/PhysRevA.70.052328","article-title":"Improved simulation of stabilizer circuits","volume":"70","author":"Aaronson Scott","year":"2004","unstructured":"Scott Aaronson and Daniel Gottesman. 2004. Improved simulation of stabilizer circuits. Physical Review A 70, 5 (2004), 052328.","journal-title":"Physical Review A"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2004.8"},{"key":"e_1_3_2_4_2","first-page":"1","volume-title":"QPL","author":"Amy Matthew","year":"2018","unstructured":"Matthew Amy. 2018. Towards large-scale functional verification of universal quantum circuits. In QPL, Peter Selinger and Giulio Chiribella (Eds.), Vol. 287. 1\u201321."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718713","volume-title":"Approximation of Large-Scale Dynamical Systems","author":"Antoulas A.","year":"2005","unstructured":"A. Antoulas. 2005. Approximation of Large-Scale Dynamical Systems. SIAM."},{"key":"e_1_3_2_6_2","first-page":"278","volume-title":"QEST","author":"Bacci Giorgio","year":"2013","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. 2013. The BisimDist library: Efficient computation of bisimilarity distances for Markovian models. In QEST, Kaustubh R. Joshi, Markus Siegle, Mari\u00eblle Stoelinga, and Pedro R. D\u2019Argenio (Eds.). 278\u2013281."},{"key":"e_1_3_2_7_2","first-page":"21:1\u201321:14","volume-title":"CONCUR (LIPIcs)","author":"Bacci Giorgio","year":"2016","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare. 2016. Complete axiomatization for the bisimilarity distance on Markov chains. In CONCUR (LIPIcs), Jos\u00e9e Desharnais and Radha Jagadeesan (Eds.), Vol. 59. 21:1\u201321:14."},{"issue":"4","key":"e_1_3_2_8_2","article-title":"A complete quantitative deduction system for the bisimilarity distance on Markov chains","volume":"14","author":"Bacci Giorgio","year":"2018","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare. 2018. A complete quantitative deduction system for the bisimilarity distance on Markov chains. Log. Methods Comput. Sci. 14, 4 (2018).","journal-title":"Log. Methods Comput. Sci."},{"key":"e_1_3_2_9_2","first-page":"1","volume-title":"Symposium on Logic in Computer Science, LICS","author":"Bacci Giorgio","year":"2021","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2021. Efficient local computation of differential bisimulations via coupling and up-to methods. In Symposium on Logic in Computer Science, LICS. 1\u201314."},{"key":"e_1_3_2_10_2","first-page":"119","volume-title":"CAV","author":"Baier Christel","year":"1997","unstructured":"Christel Baier and Holger Hermanns. 1997. Weak bisimulation for fully probabilistic processes. In CAV. 119\u2013130."},{"key":"e_1_3_2_11_2","volume-title":"Principles of Model Checking","author":"Baier Christel","year":"2008","unstructured":"Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. MIT Press."},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs (2 ed.)","author":"Bollob\u00e1s B\u00e9la","year":"2001","unstructured":"B\u00e9la Bollob\u00e1s. 2001. Random Graphs (2 ed.). Cambridge University Press."},{"issue":"1","key":"e_1_3_2_13_2","article-title":"Algebra, coalgebra, and minimization in polynomial differential equations","volume":"15","author":"Boreale Michele","year":"2019","unstructured":"Michele Boreale. 2019. Algebra, coalgebra, and minimization in polynomial differential equations. Log. Methods Comput. Sci. 15, 1 (2019).","journal-title":"Log. Methods Comput. Sci."},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"102441","DOI":"10.1016\/j.scico.2020.102441","article-title":"Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial odes","volume":"193","author":"Boreale Michele","year":"2020","unstructured":"Michele Boreale. 2020. Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial odes. Sci. Comput. Program. 193 (2020), 102441.","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.2307\/3215235","article-title":"Exact and ordinary lumpability in finite Markov chains","volume":"31","author":"Buchholz Peter","year":"1994","unstructured":"Peter Buchholz. 1994. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability 31, 1 (1994), 59\u201375.","journal-title":"Journal of Applied Probability"},{"issue":"15","key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1093\/bioinformatics\/btab081","article-title":"Exact maximal reduction of stochastic reaction networks by species lumping","volume":"37","author":"Cardelli Luca","year":"2021","unstructured":"Luca Cardelli, Isabel Cristina P\u00e9rez-Verona, Mirco Tribastone, Max Tschaikowski, Andrea Vandin, and Tabea Waizmann. 2021. Exact maximal reduction of stochastic reaction networks by species lumping. Bioinform. 37, 15 (2021), 2175\u20132182.","journal-title":"Bioinform."},{"key":"e_1_3_2_17_2","first-page":"226","volume-title":"CONCUR","author":"Cardelli Luca","year":"2015","unstructured":"Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2015. Forward and backward bisimulations for chemical reaction networks. In CONCUR. 226\u2013239."},{"key":"e_1_3_2_18_2","first-page":"485","volume-title":"Symposium on Logic in Computer Science, LICS","author":"Cardelli Luca","year":"2016","unstructured":"Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2016. Comparing chemical reaction networks: A categorical and algorithmic perspective. In Symposium on Logic in Computer Science, LICS. 485\u2013494."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.018"},{"issue":"38","key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"10029","DOI":"10.1073\/pnas.1702697114","article-title":"Maximal aggregation of polynomial dynamical systems","volume":"114","author":"Cardelli L.","year":"2017","unstructured":"L. Cardelli, M. Tribastone, Max Tschaikowski, and A. Vandin. 2017. Maximal aggregation of polynomial dynamical systems. Proceedings of the National Academy of Sciences 114, 38 (2017), 10029\u201310034.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/978-3-319-63121-9_23","volume-title":"Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday","author":"Cardelli Luca","year":"2017","unstructured":"Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2017. Syntactic Markovian bisimulation for chemical reaction networks. In Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ing\u00f3lfsd\u00f3ttir, Axel Legay, and Radu Mardare (Eds.), Vol. 10460. 466\u2013483."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99154-2_7"},{"issue":"6","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","article-title":"Optimal state-space lumping in Markov chains","volume":"87","author":"Derisavi Salem","year":"2003","unstructured":"Salem Derisavi, Holger Hermanns, and William H. Sanders. 2003. Optimal state-space lumping in Markov chains. Inform. Process. Lett. 87, 6 (2003), 309\u2013315.","journal-title":"Inform. Process. Lett."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum approximate optimization algorithm. (2014) 16 pages. DOI:10.48550\/ARXIV.1411.4028","DOI":"10.48550\/ARXIV.1411.4028"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Edward Farhi Jeffrey Goldstone Sam Gutmann and Michael Sipser. 2000. Quantum computation by adiabatic evolution. (2000) 24 pages. DOI:10.48550\/ARXIV.QUANT-PH\/0001106","DOI":"10.48550\/ARXIV.QUANT-PH\/0001106"},{"issue":"11","key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.ic.2007.08.001","article-title":"Probabilistic bisimulations for quantum processes","volume":"205","author":"Feng Yuan","year":"2007","unstructured":"Yuan Feng, Runyao Duan, Zhengfeng Ji, and Mingsheng Ying. 2007. Probabilistic bisimulations for quantum processes. Information and Computation 205, 11 (2007), 1608\u20131639.","journal-title":"Information and Computation"},{"issue":"16","key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"6453","DOI":"10.1073\/pnas.0809908106","article-title":"Internal coarse-graining of molecular systems","volume":"106","author":"Feret J\u00e9r\u00f4me","year":"2009","unstructured":"J\u00e9r\u00f4me Feret, Vincent Danos, Jean Krivine, Russ Harmer, and Walter Fontana. 2009. Internal coarse-graining of molecular systems. Proceedings of the National Academy of Sciences 106, 16 (2009), 6453\u20136458.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"0","key":"e_1_3_2_28_2","first-page":"137-164","article-title":"Lumpability abstractions of rule-based systems","volume":"431","author":"Feret Jerome","year":"2012","unstructured":"Jerome Feret, Thomas Henzinger, Heinz Koeppl, and Tatjana Petrov. 2012. Lumpability abstractions of rule-based systems. Theoretical Computer Science 431, 0 (2012), 137-164.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_29_2","first-page":"145","volume-title":"Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL05)","author":"Gay Simon J.","year":"2005","unstructured":"Simon J. Gay and Rajagopal Nagarajan. 2005. Communicating quantum processes. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL05). ACM, Long Beach, CA, USA, 145\u2013157. DOI:10.1145\/1040305.1040318"},{"issue":"3","key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"033035","DOI":"10.1088\/1367-2630\/abe972","article-title":"Bilinear dynamic mode decomposition for quantum control","volume":"23","author":"Goldschmidt Andy","year":"2021","unstructured":"Andy Goldschmidt, E. Kaiser, J. L. DuBois, S. L. Brunton, and J. N. Kutz. 2021. Bilinear dynamic mode decomposition for quantum control. New Journal of Physics 23, 3 (2021), 033035.","journal-title":"New Journal of Physics"},{"key":"e_1_3_2_31_2","first-page":"212\u2014-219","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing - STOC \u201996 (STOC \u201996)","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing - STOC \u201996 (STOC \u201996). ACM Press, Philadelphia, PA, USA, 212\u2014-219. DOI:10.1145\/237814.237866"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ismvl49045.2020.000-9"},{"issue":"15","key":"e_1_3_2_33_2","doi-asserted-by":"crossref","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","article-title":"Quantum algorithm for linear systems of equations","volume":"103","author":"Harrow Aram W.","year":"2009","unstructured":"Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. 2009. Quantum algorithm for linear systems of equations. Physical Review Letters 103, 15 (2009), 150502.","journal-title":"Physical Review Letters"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-031-15034-0_10","volume-title":"Computational Methods in Systems Biology","author":"Jim\u00e9nez-Pastor Antonio","year":"2022","unstructured":"Antonio Jim\u00e9nez-Pastor, Joshua Paul Jacob, and Gleb Pogudin. 2022. Exact linear reduction for rational dynamical systems. In Computational Methods in Systems Biology, Ion Petre and Andrei P\u0103un (Eds.). Springer International Publishing, Cham, 198\u2013216."},{"key":"e_1_3_2_35_2","first-page":"343","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024","author":"Jim\u00e9nez-Pastor Antonio","year":"2024","unstructured":"Antonio Jim\u00e9nez-Pastor, Kim G. Larsen, Mirco Tribastone, and Max Tschaikowski. 2024. Forward and backward constrained bisimulations for quantum circuits. In Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Bernd Finkbeiner and Laura Kov\u00e1cs (Eds.). 343\u2013362."},{"key":"e_1_3_2_36_2","first-page":"464","volume-title":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017","author":"Khammassi N.","year":"2017","unstructured":"N. Khammassi, I. Ashraf, X. Fu, C. G. Almudever, and K. Bertels. 2017. QX: A high-performance quantum computer simulation platform. In Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017. IEEE, Lausanne, Switzerland, 464\u2013469. DOI:10.23919\/DATE.2017.7927034"},{"issue":"1","key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"015301","DOI":"10.1088\/1751-8113\/48\/1\/015301","article-title":"On model reduction for quantum dynamics: symmetries and invariant subspaces","volume":"48","author":"Kumar Akshat","year":"2014","unstructured":"Akshat Kumar and Mohan Sarovar. 2014. On model reduction for quantum dynamics: symmetries and invariant subspaces. Journal of Physics A: Mathematical and Theoretical 48, 1 (2014), 015301.","journal-title":"Journal of Physics A: Mathematical and Theoretical"},{"issue":"1","key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen Kim G.","year":"1991","unstructured":"Kim G. Larsen and Arne Skou. 1991. Bisimulation through probabilistic testing. Inf. Comput. 94, 1 (1991), 1\u201328.","journal-title":"Inf. Comput."},{"key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-031-42697-1_8","volume-title":"Computational Methods in Systems Biology","author":"Leguizamon-Robayo Alexander","year":"2023","unstructured":"Alexander Leguizamon-Robayo, Antonio Jim\u00e9nez-Pastor, Micro Tribastone, Max Tschaikowski, and Andrea Vandin. 2023. Approximate constrained lumping of polynomial differential equations. In Computational Methods in Systems Biology, Jun Pang and Joachim Niehren (Eds.). Springer Nature Switzerland, Cham, 106\u2013123."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2026805118"},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"Meyer C. D.","year":"2000","unstructured":"C. D. Meyer. 2000. Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, USA. 00029725https:\/\/books.google.dk\/books?id=HoNgdpJWnWMC"},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1145\/3373376.3378477","volume-title":"Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201920)","author":"Murali Prakash","year":"2020","unstructured":"Prakash Murali, David C. Mckay, Margaret Martonosi, and Ali Javadi-Abhari. 2020. Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201920). ACM, Lausanne, Switzerland, 1001\u20131016. DOI:10.1145\/3373376.3378477"},{"issue":"10","key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"105043","DOI":"10.1088\/1367-2630\/11\/10\/105043","article-title":"Quantum filter reduction for measurement-feedback control via unsupervised manifold learning","volume":"11","author":"Nielsen Anne E. B.","year":"2009","unstructured":"Anne E. B. Nielsen, Asa S. Hopkins, and Hideo Mabuchi. 2009. Quantum filter reduction for measurement-feedback control via unsupervised manifold learning. New Journal of Physics 11, 10 (2009), 105043.","journal-title":"New Journal of Physics"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"issue":"1","key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TCAD.2015.2459034","article-title":"QMDDs: Efficient quantum function representation and manipulation","volume":"35","author":"Niemann Philipp","year":"2016","unstructured":"Philipp Niemann, Robert Wille, D. Michael Miller, Mitchell A. Thornton, and Rolf Drechsler. 2016. QMDDs: Efficient quantum function representation and manipulation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35, 1 (2016), 86\u201399.","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"19","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"3385","DOI":"10.1093\/bioinformatics\/btab258","article-title":"CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations","volume":"37","author":"Ovchinnikov Alexey","year":"2021","unstructured":"Alexey Ovchinnikov, Isabel P\u00e9rez Verona, Gleb Pogudin, and Mirco Tribastone. 2021. CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations. Bioinformatics 37, 19 (08 2021), 3385\u20133385.","journal-title":"Bioinformatics"},{"issue":"6","key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/9.863598","article-title":"Hierarchically consistent control systems","volume":"45","author":"Pappas George J.","year":"2000","unstructured":"George J. Pappas, Gerardo Lafferriere, and Shankar Sastry. 2000. Hierarchically consistent control systems. IEEE Trans. Automat. Contr. 45, 6 (2000), 1144\u20131160.","journal-title":"IEEE Trans. Automat. Contr."},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Nils Quetschlich Lukas Burgholzer and Robert Wille. 2022. MQT bench: Benchmarking software and design automation tools for quantum computing. (2022). arXiv:2204.13719MQT Bench is available at https:\/\/www.cda.cit.tum.de\/mqtbench\/","DOI":"10.22331\/q-2023-07-20-1062"},{"key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1017\/S0022112009992059","article-title":"Spectral analysis of nonlinear flows","volume":"641","author":"Rowley Clarence W.","year":"2009","unstructured":"Clarence W. Rowley, Igor Mezi\u010d, Shervin Bagheri, Philipp Schlatter, and Dan S. Henningson. 2009. Spectral analysis of nonlinear flows. Journal of Fluid Mechanics 641 (2009), 115\u2013127.","journal-title":"Journal of Fluid Mechanics"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","unstructured":"Aaron Sander Lukas Burgholzer and Robert Wille. 2023. Towards Hamiltonian simulation with decision diagrams. (2023). DOI:10.48550\/ARXIV.2305.02337","DOI":"10.48550\/ARXIV.2305.02337"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511777110"},{"issue":"2","key":"e_1_3_2_52_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor Peter W.","year":"1999","unstructured":"Peter W. Shor. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41, 2 (1999), 303\u2013332.","journal-title":"SIAM Rev."},{"issue":"1","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/230514.571645","article-title":"Introduction to the theory of computation","volume":"27","author":"Sipser Michael","year":"1996","unstructured":"Michael Sipser. 1996. Introduction to the theory of computation. ACM SIGACT News 27, 1 (1996), 27\u201329.","journal-title":"ACM SIGACT News"},{"issue":"8","key":"e_1_3_2_54_2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TSE.2006.74","article-title":"Backward bisimulation in Markov chain model checking","volume":"32","author":"Sproston J.","year":"2006","unstructured":"J. Sproston and S. Donatelli. 2006. Backward bisimulation in Markov chain model checking. Software Engineering, IEEE Transactions on 32, 8 (Aug. 2006), 531\u2013546.","journal-title":"Software Engineering, IEEE Transactions on"},{"key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","article-title":"ProjectQ: An open source software framework for quantum computing","volume":"2","author":"Steiger Damian S.","year":"2018","unstructured":"Damian S. Steiger, Thomas H\u00e4ner, and Matthias Troyer. 2018. ProjectQ: An open source software framework for quantum computing. Quantum 2 (2018), 49.","journal-title":"Quantum"},{"key":"e_1_3_2_56_2","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201917)","author":"Tognazzi Stefano","year":"2017","unstructured":"Stefano Tognazzi, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2017. EGAC: A genetic algorithm to compare chemical reaction networks. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201917). ACM, Berlin, Germany, 8. DOI:10.1145\/3071178.3071265"},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"3771","DOI":"10.1109\/CDC.2018.8619710","volume-title":"2018 IEEE Conference on Decision and Control (CDC\u201918)","author":"Tognazzi Stefano","year":"2018","unstructured":"Stefano Tognazzi, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. 2018. Backward invariance for linear differential algebraic equations. In 2018 IEEE Conference on Decision and Control (CDC\u201918). IEEE, Miami, FL, USA, 3771\u20133776. DOI:10.1109\/CDC.2018.8619710"},{"issue":"6","key":"e_1_3_2_58_2","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1137\/S0036139995293294","article-title":"The effect of lumping and expanding on kinetic differential equations","volume":"57","author":"Tomlin Alison S.","year":"1997","unstructured":"Alison S. Tomlin, Genyuan Li, Herschel Rabitz, and J\u00e1nos T\u00f3th. 1997. The effect of lumping and expanding on kinetic differential equations. SIAM J. Appl. Math. 57, 6 (1997), 1531\u20131556.","journal-title":"SIAM J. Appl. Math."},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2013.08.016","article-title":"Tackling continuous state-space explosion in a Markovian process algebra","volume":"517","author":"Tschaikowski Max","year":"2014","unstructured":"Max Tschaikowski and Mirco Tribastone. 2014. Tackling continuous state-space explosion in a Markovian process algebra. Theor. Comput. Sci. 517 (2014), 1\u201333.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_60_2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.peva.2016.12.005","article-title":"Spatial fluid limits for stochastic mobile networks","volume":"109","author":"Tschaikowski Max","year":"2017","unstructured":"Max Tschaikowski and Mirco Tribastone. 2017. Spatial fluid limits for stochastic mobile networks. Perform. Evaluation 109 (2017), 52\u201376.","journal-title":"Perform. Evaluation"},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","first-page":"147902","DOI":"10.1103\/PhysRevLett.91.147902","article-title":"Efficient classical simulation of slightly entangled quantum computations","volume":"91","author":"Vidal Guifr\u00e9","year":"2003","unstructured":"Guifr\u00e9 Vidal. 2003. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91 (Oct. 2003), 147902. Issue 14.","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/s41534-019-0196-1","article-title":"A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware","volume":"5","author":"Villalonga Benjamin","year":"2019","unstructured":"Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandr\u00e0. 2019. A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware. npj Quantum Information 5, 1 (2019), 86.","journal-title":"npj Quantum Information"},{"key":"e_1_3_2_63_2","volume-title":"Int\u2019l. Conf. on Quantum Software","author":"Wille Robert","unstructured":"Robert Wille, Lucas Berent, Tobias Forster, Jagatheesan Kunasaikaran, Kevin Mato, Tom Peham, Nils Quetschlich, Damian Rovara, Aaron Sander, Ludwig Schmid, et al.The MQT Handbook: A summary of design automation tools and software for quantum computing. In Int\u2019l. Conf. on Quantum Software (2024). arXiv:2405.17543"},{"issue":"3","key":"e_1_3_2_64_2","first-page":"13","article-title":"Tools for quantum computing based on decision diagrams","volume":"3","author":"Wille Robert","year":"2022","unstructured":"Robert Wille, Stefan Hillmich, and Lukas Burgholzer. 2022. Tools for quantum computing based on decision diagrams. ACM Transactions on Quantum Computing 3, 3, Article 13 (June 2022), 17 pages.","journal-title":"ACM Transactions on Quantum Computing"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","unstructured":"Mingsheng Ying and Yuan Feng. 2018. Model checking quantum systems \u2014 A survey. (2018). DOI:10.48550\/ARXIV.1807.09466","DOI":"10.48550\/ARXIV.1807.09466"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629680"},{"issue":"5","key":"e_1_3_2_67_2","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/TCAD.2018.2834427","article-title":"Advanced simulation of quantum computations","volume":"38","author":"Zulehner Alwin","year":"2019","unstructured":"Alwin Zulehner and Robert Wille. 2019. Advanced simulation of quantum computations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38, 5 (2019), 848\u2013859.","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712711","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:09Z","timestamp":1750295889000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":66,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3712711"],"URL":"https:\/\/doi.org\/10.1145\/3712711","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]},"assertion":[{"value":"2024-05-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}