{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:15:09Z","timestamp":1762460109119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031163357"},{"type":"electronic","value":"9783031163364"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16336-4_18","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T18:02:40Z","timestamp":1662832960000},"page":"359-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mirrors and\u00a0Memory in\u00a0Quantum Automata"],"prefix":"10.1007","author":[{"given":"Carla","family":"Piazza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Romanello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00224-005-1263-x","volume":"39","author":"A Ambainis","year":"2006","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic results on quantum automata. Theory Comput. Syst. 39(1), 165\u2013188 (2006)","journal-title":"Theory Comput. Syst."},{"key":"18_CR2","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 332\u2013341. IEEE (1998)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-40578-0_16","volume-title":"Reversible Computation","author":"L Anticoli","year":"2016","unstructured":"Anticoli, L., Piazza, C., Taglialegne, L., Zuliani, P.: Towards quantum programs verification: from Quipper circuits to QPMC. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 213\u2013219. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_16"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11047-019-09762-6","volume":"18","author":"P Arrighi","year":"2019","unstructured":"Arrighi, P.: An overview of quantum cellular automata. Nat. Comput. 18(4), 885\u2013899 (2019)","journal-title":"Nat. Comput."},{"key":"18_CR5","unstructured":"Bell, P.C., Hirvensalo, M.: Acceptance ambiguity for quantum automata. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-73208-2_9","volume-title":"Developments in Language Theory","author":"A Belovs","year":"2007","unstructured":"Belovs, A., Rosmanis, A., Smotrovs, J.: Multi-letter reversible and quantum finite automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 60\u201371. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_9"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11511-007-0015-y","volume":"198","author":"V Bergelson","year":"2007","unstructured":"Bergelson, V., Leibman, A.: Distribution of values of bounded generalized polynomials. Acta Mathem. 198(2), 155\u2013230 (2007)","journal-title":"Acta Mathem."},{"issue":"1\u20132","key":"18_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(00)00154-7","volume":"262","author":"A Bertoni","year":"2001","unstructured":"Bertoni, A., Carpentieri, M.: Analogies and differences between quantum and stochastic automata. Theort. Comput. Sci. 262(1\u20132), 69\u201381 (2001)","journal-title":"Theort. Comput. Sci."},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45007-6_1","volume-title":"Developments in Language Theory","author":"A Bertoni","year":"2003","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Quantum Computing: 1-way quantum automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 1\u201320. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45007-6_1"},{"key":"18_CR10","unstructured":"Bhatia, A.S., Kumar, A.: Quantum finite automata: survey, status and research directions. arXiv preprint arXiv:1901.07992 (2019)"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10849-019-09302-6","volume":"29","author":"AS Bhatia","year":"2020","unstructured":"Bhatia, A.S., Kumar, A.: On relation between linear temporal logic and quantum finite automata. J. Logic Lang. Inf. 29(2), 109\u2013120 (2020)","journal-title":"J. Logic Lang. Inf."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2016.01.045","volume":"664","author":"MP Bianchi","year":"2017","unstructured":"Bianchi, M.P., Mereghetti, C., Palano, B.: Quantum finite automata: advances on Bertoni\u2019s ideas. Theoret. Comput. Sci. 664, 39\u201353 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77980-1_1","volume-title":"Computational Science \u2013 ICCS 2021","author":"U Birkan","year":"2021","unstructured":"Birkan, U., Salehi, \u00d6., Olejar, V., Nurlu, C., Yakary\u0131lmaz, A.: Implementing quantum finite automata algorithms on noisy devices. In: Paszynski, M., Kranzlm\u00fcller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2021. LNCS, vol. 12747, pp. 3\u201316. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77980-1_1"},{"issue":"5","key":"18_CR14","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31(5), 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R., et al.: Handbook of Model Checking, vol. 10. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8","DOI":"10.1007\/978-3-319-10575-8"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1119\/1.1975488","volume":"37","author":"PAM Dirac","year":"1969","unstructured":"Dirac, P.A.M.: Lectures on quantum field theory. Am. J. Phy. 37, 233\u2013233 (1969)","journal-title":"Am. J. Phy."},{"issue":"7","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1016\/j.jcss.2013.04.002","volume":"79","author":"Y Feng","year":"2013","unstructured":"Feng, Y., Yu, N., Ying, M.: Model checking quantum Markova chains. J. Comput. Syst. Sci. 79(7), 1181\u20131198 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1799-0","volume":"17","author":"A Gainutdinova","year":"2018","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Unary probabilistic and quantum automata on promise problems. Quant. Inf. Process. 17(2), 1\u201317 (2018)","journal-title":"Quant. Inf. Process."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-70545-1_51","volume-title":"Computer Aided Verification","author":"SJ Gay","year":"2008","unstructured":"Gay, S.J., Nagarajan, R., Papanikolaou, N.: QMC: a model checker for quantum systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 543\u2013547. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_51"},{"issue":"1\u20132","key":"18_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(00)00305-4","volume":"274","author":"H Hermanns","year":"2002","unstructured":"Hermanns, H., Herzog, U., Katoen, J.P.: Process algebra for performance evaluation. Theoret. Comput. Sci. 274(1\u20132), 43\u201387 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Katoen, J.P.: The probabilistic model checking landscape. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 31\u201345 (2016)","DOI":"10.1145\/2933575.2934574"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2022.02.026","volume":"920","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., et al.: Two-way and one-way quantum and classical automata with advice for online minimization problems. Theoret Comput. Sci. 920, 76\u201394 (2022)","journal-title":"Theoret Comput. Sci."},{"key":"18_CR23","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 66\u201375 (1997)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-57685-5_3","volume-title":"Formal System Verification","author":"M Kwiatkowska","year":"2018","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic model checking: advances and applications. In: Drechsler, R. (ed.) Formal System Verification, pp. 73\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-57685-5_3"},{"issue":"3","key":"18_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/3494656.3494666","volume":"52","author":"C Mereghetti","year":"2021","unstructured":"Mereghetti, C., Palano, B.: Guest column: Quantum finite automata: From theory to practice. ACM SIGACT News 52(3), 38\u201359 (2021)","journal-title":"ACM SIGACT News"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Mereghetti, C., Palano, B., Cialdi, S., Vento, V., Paris, M.G., Olivares, S.: Photonic realization of a quantum finite automaton. Physical Review Research 2(1), 013089 (2020)","DOI":"10.1103\/PhysRevResearch.2.013089"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237(1\u20132), 275\u2013306 (2000)","DOI":"10.1016\/S0304-3975(98)00191-1"},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-33133-6","DOI":"10.1007\/3-540-33133-6"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Paschen, K.: Quantum finite automata using ancilla qubits. Technical report, Universit\u00e4t Karlsruhe (TH) (2000). https:\/\/doi.org\/10.5445\/IR\/1452000","DOI":"10.5445\/IR\/1452000"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Qiu, D., Yu, S.: Hierarchy and equivalence of multi-letter quantum finite automata. Theoret. Comput. Sci. 410(30\u201332), 3006\u20133017 (2009)","DOI":"10.1016\/j.tcs.2009.03.040"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Qiu, D., Mateus, P., Sernadas, A.: One-way quantum finite automata together with classical states. arXiv preprint arXiv:0909.1428 pp. 3006\u20133017 (2009)","DOI":"10.1016\/j.tcs.2009.03.040"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230\u2013245 (1963)","DOI":"10.1016\/S0019-9958(63)90290-0"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Von Neumann, J.: Mathematical foundations of quantum mechanics. In: Mathematical Foundations of Quantum Mechanics. Princeton University Press, Princeton (2018)","DOI":"10.23943\/princeton\/9780691178561.001.0001"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16336-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T20:31:52Z","timestamp":1701030712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16336-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031163357","9783031163364"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16336-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest.org\/qest2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"44","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":"19","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":"1","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":"43% - 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":"3-4","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)"}}]}}