{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T21:12:53Z","timestamp":1792185173070,"version":"4.4.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572487","type":"print"},{"value":"9783031572494","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Efficient methods for the simulation of quantum circuits on classic 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. Furthermore, we show that constraint bisimulation complements state-of-the-art methods for the simulation of quantum circuits based on decision diagrams.<\/jats:p>","DOI":"10.1007\/978-3-031-57249-4_17","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T07:02:35Z","timestamp":1712214155000},"page":"343-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Forward and Backward Constrained Bisimulations for Quantum Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6096-0623","authenticated-orcid":false,"given":"A.","family":"Jim\u00e9nez-Pastor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5953-3384","authenticated-orcid":false,"given":"K. G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6018-5989","authenticated-orcid":false,"given":"M.","family":"Tribastone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6186-8669","authenticated-orcid":false,"given":"M.","family":"Tschaikowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Physical Review A 70(5), 052328 (2004)","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: 45th IEEE Symposium on Foundations of Computer Science. pp. 42\u201351 (2004)","DOI":"10.1109\/FOCS.2004.8"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Amy, M.: Towards large-scale functional verification of universal quantum circuits. In: Selinger, P., Chiribella, G. (eds.) QPL. vol.\u00a0287, pp. 1\u201321 (2018)","DOI":"10.4204\/EPTCS.287.1"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Antoulas, A.: Approximation of Large-Scale Dynamical Systems. Advances in Design and Control, SIAM (2005)","DOI":"10.1137\/1.9780898718713"},{"key":"17_CR5","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Complete axiomatization for the bisimilarity distance on markov chains. In: Desharnais, J., Jagadeesan, R. (eds.) CONCUR. LIPIcs, vol.\u00a059, pp. 21:1\u201321:14 (2016)"},{"key":"17_CR6","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: A complete quantitative deduction system for the bisimilarity distance on markov chains. Log. Methods Comput. Sci. 14(4) (2018)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Tribastone, M., Tschaikowski, M., Vandin, A.: Efficient local computation of differential bisimulations via coupling and up-to methods. In: Symposium on Logic in Computer Science, LICS. pp. 1\u201314 (2021)","DOI":"10.1109\/LICS52264.2021.9470555"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: The bisimdist library: Efficient computation of bisimilarity distances for markovian models. In: Joshi, K.R., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST. pp. 278\u2013281 (2013)","DOI":"10.1007\/978-3-642-40196-1_23"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: CAV. pp. 119\u2013130 (1997)","DOI":"10.1007\/3-540-63166-6_14"},{"key":"17_CR10","unstructured":"Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)"},{"key":"17_CR11","unstructured":"Boreale, M.: Algebra, coalgebra, and minimization in polynomial differential equations. Log. Methods Comput. Sci. 15(1) (2019)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Boreale, M.: Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial odes. Sci. Comput. Program. 193, 102441 (2020)","DOI":"10.1016\/j.scico.2020.102441"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability 31(1), 59\u201375 (1994)","DOI":"10.2307\/3215235"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Maximal aggregation of polynomial dynamical systems. Proceedings of the National Academy of Sciences 114(38), 10029 \u2013 10034 (2017)","DOI":"10.1073\/pnas.1702697114"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Cardelli, L., P\u00e9rez-Verona, I.C., Tribastone, M., Tschaikowski, M., Vandin, A., Waizmann, T.: Exact maximal reduction of stochastic reaction networks by species lumping. Bioinform. 37(15), 2175\u20132182 (2021)","DOI":"10.1093\/bioinformatics\/btab081"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Forward and backward bisimulations for chemical reaction networks. In: CONCUR. pp. 226\u2013239 (2015)","DOI":"10.1145\/2933575.2935318"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Comparing chemical reaction networks: A categorical and algorithmic perspective. In: Symposium on Logic in Computer Science, LICS. pp. 485\u2013494 (2016)","DOI":"10.1145\/2933575.2935318"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Symbolic computation of differential equivalences. In: POPL. pp. 137\u2013150 (2016)","DOI":"10.1145\/2914770.2837649"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Guaranteed error bounds on approximate model abstractions through reachability analysis. In: QEST. pp. 104\u2013121 (2018)","DOI":"10.1007\/978-3-319-99154-2_7"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Information Processing Letters 87(6), 309 \u2013 315 (2003)","DOI":"10.1016\/S0020-0190(03)00343-0"},{"key":"17_CR21","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"17_CR22","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106 (2000)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Feng, Y., Duan, R., Ji, Z., Ying, M.: Probabilistic bisimulations for quantum processes. Information and Computation 205(11), 1608\u20131639 (2007)","DOI":"10.1016\/j.ic.2007.08.001"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Feret, J., Danos, V., Krivine, J., Harmer, R., Fontana, W.: Internal coarse-graining of molecular systems. Proceedings of the National Academy of Sciences 106(16), 6453\u20136458 (2009)","DOI":"10.1073\/pnas.0809908106"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Feret, J., Henzinger, T., Koeppl, H., Petrov, T.: Lumpability abstractions of rule-based systems. Theoretical Computer Science 431(0), 137 \u2013 164 (2012)","DOI":"10.1016\/j.tcs.2011.12.059"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: POPL. p. 145\u2013157 (2005)","DOI":"10.1145\/1047659.1040318"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Goldschmidt, A., Kaiser, E., DuBois, J.L., Brunton, S.L., Kutz, J.N.: Bilinear dynamic mode decomposition for quantum control. New Journal of Physics 23(3), 033035 (2021)","DOI":"10.1088\/1367-2630\/abe972"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Righth Annual ACM Symposium on Theory of computing. pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Grurl, T., Fu\u00df, J., Hillmich, S., Burgholzer, L., Wille, R.: Arrays vs. decision diagrams: A case study on quantum circuit simulators. In: IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). pp. 176\u2013181 (2020)","DOI":"10.1109\/ISMVL49045.2020.000-9"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Physical Review Letters 103(15), 150502 (2009)","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez-Pastor, A., Jacob, J.P., Pogudin, G.: Exact Linear Reduction for Rational Dynamical Systems, pp. 198\u2013216. Springer International Publishing (2022)","DOI":"10.1007\/978-3-031-15034-0_10"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Khammassi, N., Ashraf, I., Fu, X., Almudever, C.G., Bertels, K.: Qx: A high-performance quantum computer simulation platform. In: Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017. pp. 464\u2013469. IEEE (2017)","DOI":"10.23919\/DATE.2017.7927034"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sarovar, M.: On model reduction for quantum dynamics: symmetries and invariant subspaces. Journal of Physics A: Mathematical and Theoretical 48(1), 015301 (2014)","DOI":"10.1088\/1751-8113\/48\/1\/015301"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Leguizamon-Robayo, A., Jim\u00e9nez-Pastor, A., Tribastone, M., Tschaikowski, M., Vandin, A.: Approximate Constrained Lumping of Polynomial Differential Equations, pp. 106\u2013123. Springer Nature Switzerland (2023)","DOI":"10.1007\/978-3-031-42697-1_8"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Liu, J.P., Kolden, H.\u00d8., Krovi, H.K., Loureiro, N.F., Trivisa, K., Childs, A.M.: Efficient quantum algorithm for dissipative nonlinear differential equations. Proceedings of the National Academy of Sciences 118(35)(2021)","DOI":"10.1073\/pnas.2026805118"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM (2001)","DOI":"10.1137\/1.9780898719512"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Murali, P., McKay, D.C., Martonosi, M., Javadi-Abhari, A.: 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. pp. 1001\u20131016 (2020)","DOI":"10.1145\/3373376.3378477"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Nielsen, A.E., Hopkins, A.S., Mabuchi, H.: Quantum filter reduction for measurement-feedback control via unsupervised manifold learning. New Journal of Physics 11(10), 105043 (2009)","DOI":"10.1088\/1367-2630\/11\/10\/105043"},{"key":"17_CR40","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"key":"17_CR41","doi-asserted-by":"crossref","unstructured":"Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: Qmdds: Efficient quantum function representation and manipulation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(1), 86\u201399 (2016)","DOI":"10.1109\/TCAD.2015.2459034"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Ovchinnikov, A., P\u00e9rez\u00a0Verona, I., Pogudin, G., Tribastone, M.: CLUE: exact maximal reduction of kinetic models by constrained lumping of differential equations. Bioinformatics 37(19), 3385\u20133385 (08 2021)","DOI":"10.1093\/bioinformatics\/btab258"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"Pappas, G.J., Lafferriere, G., Sastry, S.: Hierarchically consistent control systems. IEEE Trans. Automat. Contr. 45(6), 1144\u20131160 (2000)","DOI":"10.1109\/9.863598"},{"key":"17_CR44","doi-asserted-by":"crossref","unstructured":"Quetschlich, N., Burgholzer, L., Wille, R.: MQT Bench: Benchmarking software and design automation tools for quantum computing (2022), MQT Bench is available at https:\/\/www.cda.cit.tum.de\/mqtbench\/","DOI":"10.22331\/q-2023-07-20-1062"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Rowley, C.W., Mezi\u010d, I., Bagheri, S., Schlatter, P., Henningson, D.S.: Spectral analysis of nonlinear flows. Journal of Fluid Mechanics 641, 115\u2013127 (2009)","DOI":"10.1017\/S0022112009992059"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511777110"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review 41(2), 303\u2013332 (1999)","DOI":"10.1137\/S0036144598347011"},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Introduction to the theory of computation. ACM SIGACT News 27(1), 27\u201329 (1996)","DOI":"10.1145\/230514.571645"},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Sproston, J., Donatelli, S.: Backward bisimulation in Markov chain model checking. Software Engineering, IEEE Transactions on 32(8), 531\u2013546 (Aug 2006)","DOI":"10.1109\/TSE.2006.74"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: Projectq: an open source software framework for quantum computing. Quantum 2, \u00a049 (2018)","DOI":"10.22331\/q-2018-01-31-49"},{"key":"17_CR51","doi-asserted-by":"crossref","unstructured":"Tognazzi, S., Tribastone, M., Tschaikowski, M., Vandin, A.: EGAC: a genetic algorithm to compare chemical reaction networks. In: Bosman, P.A.N. (ed.) GECCO. pp. 833\u2013840. ACM (2017)","DOI":"10.1145\/3071178.3071265"},{"key":"17_CR52","doi-asserted-by":"crossref","unstructured":"Tognazzi, S., Tribastone, M., Tschaikowski, M., Vandin, A.: Backward Invariance for Linear Differential Algebraic Equations. In: CDC. pp. 3771\u20133776 (2018)","DOI":"10.1109\/CDC.2018.8619710"},{"key":"17_CR53","doi-asserted-by":"crossref","unstructured":"Tomlin, A.S., Li, G., Rabitz, H., T\u00f3th, J.: The effect of lumping and expanding on kinetic differential equations. SIAM Journal on Applied Mathematics 57(6), 1531\u20131556 (1997)","DOI":"10.1137\/S0036139995293294"},{"key":"17_CR54","doi-asserted-by":"crossref","unstructured":"Tschaikowski, M., Tribastone, M.: Spatial fluid limits for stochastic mobile networks. Perform. Evaluation 109, 52\u201376 (2017)","DOI":"10.1016\/j.peva.2016.12.005"},{"key":"17_CR55","doi-asserted-by":"crossref","unstructured":"Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (Oct 2003)","DOI":"10.1103\/PhysRevLett.91.147902"},{"key":"17_CR56","doi-asserted-by":"crossref","unstructured":"Villalonga, B., Boixo, S., Nelson, B., Henze, C., Rieffel, E., Biswas, R., Mandr\u00e0, S.: A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware. npj Quantum Information 5(1), \u00a086 (2019)","DOI":"10.1038\/s41534-019-0196-1"},{"key":"17_CR57","doi-asserted-by":"crossref","unstructured":"Wille, R., Hillmich, S., Burgholzer, L.: Tools for quantum computing based on decision diagrams. ACM Transactions on Quantum Computing 3(3) (jun 2022)","DOI":"10.1145\/3491246"},{"key":"17_CR58","doi-asserted-by":"crossref","unstructured":"Ying, M., Feng, Y.: Model checking quantum systems - A survey (2018), arxiv","DOI":"10.1093\/nsr\/nwy106"},{"key":"17_CR59","doi-asserted-by":"crossref","unstructured":"Ying, M., Li, Y., Yu, N., Feng, Y.: Model-checking linear-time properties of quantum systems. ACM Trans. Comput. Logic 15(3) (2014)","DOI":"10.1145\/2629680"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57249-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T17:16:29Z","timestamp":1731690989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57249-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572487","9783031572494"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57249-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}