{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T04:02:23Z","timestamp":1747368143831,"version":"3.40.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031889295","type":"print"},{"value":"9783031889301","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-88930-1_6","type":"book-chapter","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:12:54Z","timestamp":1747289574000},"page":"111-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconciling Quantum Theory and\u00a0Process Equivalence via\u00a0Physically Admissible Schedulers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1288-9623","authenticated-orcid":false,"given":"Lorenzo","family":"Ceragioli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0573-7974","authenticated-orcid":false,"given":"Giuseppe","family":"Lomurno","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5345-9141","authenticated-orcid":false,"given":"Gabriele","family":"Tedeschi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,16]]},"reference":[{"issue":"28","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.tcs.2011.02.045","volume":"412","author":"ME Andr\u00e9s","year":"2011","unstructured":"Andr\u00e9s, M.E., Palamidessi, C., van Rossum, P., Sokolova, A.: Information hiding in probabilistic concurrent systems. Theoret. Comput. Sci. 412(28), 3072\u20133089 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Bennet, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theoret. Comput. Sci. 560, 7\u201311 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.05.025. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397514004241. Theoretical Aspects of Quantum Cryptography \u2013 celebrating 30 years of BB84","DOI":"10.1016\/j.tcs.2014.05.025"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11864219_17","volume-title":"Distributed Computing","author":"R Canetti","year":"2006","unstructured":"Canetti, R., et al.: Time-bounded task-PIOAs: a framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 238\u2013253. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_17"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Effect semantics for quantum process calculi. In: Majumdar, R., Silva, A. (eds.) 35th International Conference on Concurrency Theory, CONCUR 2024, 9\u201313 September 2024, Calgary, Canada. LIPIcs, vol.\u00a0311, pp. 16:1\u201316:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2024.16","DOI":"10.4230\/LIPICS.CONCUR.2024.16"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Quantum bisimilarity is a congruence under physically admissible schedulers. In: Kiselyov, O. (ed.) Programming Languages and Systems - 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, 22\u201324 October 2024, Proceedings. Lecture Notes in Computer Science, vol. 15194, pp. 176\u2013195. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-97-8943-6_9","DOI":"10.1007\/978-981-97-8943-6_9"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Quantum bisimilarity via barbs and contexts: curbing the power of non-deterministic observers. Proc. ACM Program. Lang. 8(POPL) (2024). https:\/\/doi.org\/10.1145\/3632885","DOI":"10.1145\/3632885"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Testing quantum processes. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola - 12th International Symposium, ISoLA 2024, Crete, Greece, 27\u201331 October 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 15219, pp. 132\u2013151. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-73709-1_9","DOI":"10.1007\/978-3-031-73709-1_9"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Norman, G., Parker, D.: Bisimulation for demonic schedulers. In: de\u00a0Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 318\u2013332. Springer (2009)","DOI":"10.1007\/978-3-642-00596-1_23"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 42\u201358. Springer (2007)","DOI":"10.1007\/978-3-540-74407-8_4"},{"key":"6_CR10","unstructured":"Davidson, T.A.S.: Formal Verification Techniques Using Quantum Process Calculus. Ph.D. thesis, University of Warwick (2012). http:\/\/wrap.warwick.ac.uk\/51368\/"},{"issue":"1\u20132","key":"6_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.C.: Testing equivalences for processes. Theoret. Comput. Sci. 34(1\u20132), 83\u2013133 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Deng, Y.: Bisimulations for probabilistic and quantum processes (invited paper). In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, 4\u20137 September 2018, Beijing, China. LIPIcs, vol.\u00a0118, pp. 2:1\u20132:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.2","DOI":"10.4230\/LIPIcs.CONCUR.2018.2"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-33475-7_9","volume-title":"Theoretical Computer Science","author":"Y Deng","year":"2012","unstructured":"Deng, Y., Feng, Y.: Open bisimulation for quantum processes. In: Baeten, J., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 119\u2013133. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33475-7_9"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-04081-8_19","volume-title":"CONCUR 2009 - Concurrency Theory","author":"Y Deng","year":"2009","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 274\u2013288. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_19"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput. 222, 139\u2013168 (2013). https:\/\/doi.org\/10.1016\/j.ic.2012.10.010. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540112001514. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)","DOI":"10.1016\/j.ic.2012.10.010"},{"issue":"11","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1016\/j.ic.2007.08.001","volume":"205","author":"Y Feng","year":"2007","unstructured":"Feng, Y., Duan, R., Ji, Z., Ying, M.: Probabilistic bisimulations for quantum processes. Inf. Comput. 205(11), 1608\u20131639 (2007). https:\/\/doi.org\/10.1016\/j.ic.2007.08.001","journal-title":"Inf. Comput."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Feng, Y., Duan, R., Ying, M.: Bisimulation for quantum processes. ACM Trans. Program. Lang. Syst. 34(4), 17:1\u201317:43 (2012). https:\/\/doi.org\/10.1145\/2400676.2400680","DOI":"10.1145\/2400676.2400680"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Feng, Y., Ying, M.: Toward automatic verification of quantum cryptographic protocols. In: Aceto, L., de\u00a0Frutos-Escrig, D. (eds.) 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, 1\u20134 September 2015. LIPIcs, vol.\u00a042, pp. 441\u2013455. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.441","DOI":"10.4230\/LIPIcs.CONCUR.2015.441"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Palsberg, J., Abadi, M. (eds.) Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, 12\u201314 January 2005, pp. 145\u2013157. ACM (2005). https:\/\/doi.org\/10.1145\/1040305.1040318","DOI":"10.1145\/1040305.1040318"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15) (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","DOI":"10.1103\/PhysRevLett.103.150502"},{"issue":"4\u20136","key":"6_CR21","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00165-012-0242-7","volume":"24","author":"M Hennessy","year":"2012","unstructured":"Hennessy, M.: Exploring probabilistic bisimulations, part I. Formal Aspects Comput. 24(4\u20136), 749\u2013768 (2012). https:\/\/doi.org\/10.1007\/s00165-012-0242-7","journal-title":"Formal Aspects Comput."},{"key":"6_CR22","unstructured":"Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., Sakurada, H.: Application of a process calculus to security proofs of quantum protocols. In: International Conference on Foundations of Computer Science (FCS 2012), 16\u201319 July 2012, at Monte Carlo Resort, Las Vegas, USA, Proceedings, pp. 141\u2013147. CSREA Press (2012)"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jsc.2015.05.001","volume":"73","author":"T Kubota","year":"2016","unstructured":"Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., Sakurada, H.: Semi-automated verification of security proofs of quantum cryptographic protocols. J. Symb. Comput. 73, 192\u2013220 (2016). https:\/\/doi.org\/10.1016\/j.jsc.2015.05.001","journal-title":"J. Symb. Comput."},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S096012950600524X","volume":"16","author":"M Lalire","year":"2006","unstructured":"Lalire, M.: Relations among quantum processes: bisimilarity and congruence. Math. Struct. Comput. Sci. 16(3), 407\u2013428 (2006). https:\/\/doi.org\/10.1017\/S096012950600524X","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Mousavi, M.R., Peters, K., Schmitt, A.: Towards a formal testing theory for quantum processes. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola - 12th International Symposium, ISoLA 2024, Crete, Greece, 27\u201331 October 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 15219, pp. 111\u2013131. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-73709-1_8","DOI":"10.1007\/978-3-031-73709-1_8"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"16","key":"6_CR27","doi-asserted-by":"publisher","first-page":"3865","DOI":"10.1364\/OPEX.12.003865","volume":"12","author":"A Poppe","year":"2004","unstructured":"Poppe, A., et al.: Practical quantum key distribution with polarization-entangled photons. Opt. Express 12(16), 3865 (2004). https:\/\/doi.org\/10.1364\/OPEX.12.003865","journal-title":"Opt. Express"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Segala, R.: A compositional trace-based semantics for probabilistic automata. In: International Conference on Concurrency Theory, pp. 234\u2013248. Springer (1995)","DOI":"10.1007\/3-540-60218-6_17"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20\u201322 November 1994, pp. 124\u2013134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"6_CR30","unstructured":"Song, L., Feng, Y., Zhang, L.: Decentralized bisimulation for multiagent systems. In: Weiss, G., Yolum, P., Bordini, R.H., Elkind, E. (eds.) AAMAS 2015, pp. 209\u2013217. ACM (2015)"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Tani, S., Kobayashi, H., Matsumoto, K.: Exact quantum algorithms for the leader election problem. ACM Trans. Comput. Theory 4(1), 1:1\u20131:24 (2012). https:\/\/doi.org\/10.1145\/2141938.2141939","DOI":"10.1145\/2141938.2141939"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: LINN, R., UYAR, M. (eds.) Protocol Specification, Testing and Verification, XII, pp. 47\u201361. IFIP Transactions C: Communication Systems, Elsevier, Amsterdam (1992). https:\/\/doi.org\/10.1016\/B978-0-444-89874-6.50010-6. https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780444898746500106","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-88930-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:13:01Z","timestamp":1747289581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-88930-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031889295","9783031889301"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-88930-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algebraic Development Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}