{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:48:46Z","timestamp":1759178926183,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819789429"},{"type":"electronic","value":"9789819789436"}],"license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"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-981-97-8943-6_9","type":"book-chapter","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T08:45:29Z","timestamp":1730105129000},"page":"176-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Bisimilarity Is a Congruence Under Physically 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\/0000-0003-0690-3051","authenticated-orcid":false,"given":"Fabio","family":"Gadducci","sequence":"additional","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":[[2024,10,28]]},"reference":[{"issue":"28","key":"9_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":"9_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theoret. Comput. Sci. 560, 7\u201311 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"CH Bennett","year":"1993","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70, 1895\u20131899 (1993)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69, 2881\u20132884 (1992)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2631916","volume":"15","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: A general theory of barbs, contexts, and labels. ACM Trans. Comput. Log. 15(4), 1\u201327 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"9_CR6","unstructured":"Caleffi, M., Cacciapuoti, A.S., Bianchi, G.: Quantum internet: from communication to distributed computing! In: Benediktsson, J.A., Dressler, F. (eds.) NANOCOM 2018, pp. 3:1\u20133:4. ACM (2018)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Cheung, L., Kaynar, D.K., Liskov, M.D., Lynch, N.A., Pereira, O., Segala, R.: Time-bounded task-PIOAs: a framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 238\u2013253. Springer (2006)","DOI":"10.1007\/11864219_17"},{"key":"9_CR8","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Effect semantics for quantum process calculi. In: Majumdar, R., Silva, A. (eds.) CONCUR 2024. LIPIcs, vol.\u00a0311, pp. 16:1\u201316:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Quantum bisimilarity is a congruence under physically admissible schedulers. CoRR abs\/2408.15087 (2024)","DOI":"10.1007\/978-981-97-8943-6_9"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Ceragioli, L., Gadducci, F., Lomurno, G., Tedeschi, G.: Quantum bisimilarity via barbs and contexts: curbing the power of non-deterministic observers. Proc ACM Prog Lang 8(POPL), 43:1269\u201343:1297 (2024)","DOI":"10.1145\/3632885"},{"key":"9_CR11","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":"9_CR12","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":"9_CR13","unstructured":"Davidson, T.A.S.: Formal Verification Techniques Using Quantum Process Calculus. Ph.D. thesis, University of Warwick (2012)"},{"key":"9_CR14","unstructured":"Deng, Y.: Bisimulations for probabilistic and quantum processes. In: Schewe, S., Zhang, L. (eds.) CONCUR 2018. LIPIcs, vol.\u00a0118, pp. 2:1\u20132:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Deng, Y., Feng, Y.: Open bisimulation for quantum processes. In: Baeten, J.C.M., Ball, T., de\u00a0Boer, F.S. (eds.) TCS 2012. LNCS, vol.\u00a07604, pp. 119\u2013133. Springer (2012)","DOI":"10.1007\/978-3-642-33475-7_9"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Y., Duan, R., Ying, M.: Bisimulation for quantum processes. ACM Trans. Program. Lang. Syst. 34(4), 17:1\u201317:43 (2012)","DOI":"10.1145\/2400676.2400680"},{"key":"9_CR17","unstructured":"Feng, Y., Ying, M.: Toward automatic verification of quantum cryptographic protocols. In: Aceto, L., de\u00a0Frutos-Escrig, D. (eds.) CONCUR 2015. LIPIcs, vol.\u00a042, pp. 441\u2013455. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"issue":"7","key":"9_CR18","doi-asserted-by":"publisher","first-page":"70301","DOI":"10.1007\/s11433-018-9324-6","volume":"62","author":"F Gao","year":"2019","unstructured":"Gao, F., Qin, S., Huang, W., Wen, Q.: Quantum private query: a new kind of practical quantum cryptographic protocol. Sci. China Phys. Mech. Astron. 62(7), 70301 (2019)","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 145\u2013157. ACM (2005)","DOI":"10.1145\/1040305.1040318"},{"key":"9_CR20","unstructured":"Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., Sakurada, H.: Application of a process calculus to security proofs of quantum protocols. In: Arabnia, H.R., Gravvanis, G.A., Solo, A.M.G. (eds.) FCS 2012, pp. 141\u2013147. CSREA Press (2012)"},{"key":"9_CR21","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)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"9_CR22","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)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9_CR23","unstructured":"Lalire, M., Jorrand, P.: A process algebraic approach to concurrent and distributed quantum computation: operational semantics. CoRR quant-ph\/0407005 (2004)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Long, G.l., Deng, F.g., Wang, C., Li, X.H., Wen, K., Wang, W.Y.: Quantum secure direct communication and deterministic secure quantum communication. Front. Phys. China 2(3), 251\u2013272 (2007)","DOI":"10.1007\/s11467-007-0050-3"},{"key":"9_CR25","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2010)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Nurhadi, A.I., Syambas, N.R.: Quantum key distribution (QKD) protocols: a survey. In: ICWT 2018, pp.\u00a01\u20135. IEEE (2018)","DOI":"10.1109\/ICWT.2018.8527822"},{"key":"9_CR27","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. Ph.D. thesis, Massachusetts Institute of Technology (1995)"},{"key":"9_CR28","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)"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MWC.012.2200295","volume":"31","author":"P Zhang","year":"2024","unstructured":"Zhang, P., Chen, N., Shen, S., Yu, S., Wu, S., Kumar, N.: Future quantum communications and networking: a review and vision. IEEE Wirel. Commun. 31(1), 141\u2013148 (2024)","journal-title":"IEEE Wirel. Commun."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8943-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T16:52:41Z","timestamp":1748364761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8943-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"ISBN":["9789819789429","9789819789436"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8943-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"28 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"23 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}