{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:17:41Z","timestamp":1773717461301,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642334740","type":"print"},{"value":"9783642334757","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_9","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:43:09Z","timestamp":1347086589000},"page":"119-133","source":"Crossref","is-referenced-by-count":20,"title":["Open Bisimulation for Quantum Processes"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press (1990)","DOI":"10.1017\/CBO9780511624193"},{"key":"9_CR2","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, pp. 175\u2013179 (1984)"},{"key":"9_CR3","unstructured":"Davidson, T.A.S.: Formal Verification Techniques using Quantum Process Calculus. PhD thesis, University of Warwick (2011)"},{"key":"9_CR4","unstructured":"Deng, Y., Du, W.: Logical, metric, and algorithmic characterisations of probabilistic bisimulation. Technical Report CMU-CS-11-110. Carnegie Mellon University (March 2011)"},{"key":"9_CR5","unstructured":"Deng, Y., Feng, Y.: Open bisimulation for quantum processes. Full Version of the current paper, http:\/\/arxiv.org\/abs\/1201.0416"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-22012-8_24","volume-title":"Automata, Languages and Programming","author":"Y. Deng","year":"2011","unstructured":"Deng, Y., Hennessy, M.: On the Semantics of Markov Automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 307\u2013318. Springer, Heidelberg (2011)"},{"key":"9_CR7","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 (Extended Abstract). In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 274\u2013288. Springer, Heidelberg (2009)"},{"issue":"11","key":"9_CR8","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. Information and Computation\u00a0205(11), 1608\u20131639 (2007)","journal-title":"Information and Computation"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Feng, Y., Duan, R., Ying, M.: Bisimulation for quantum processes. In: Proc. POPL 2011, pp. 523\u2013534. ACM (2011)","DOI":"10.1145\/1925844.1926446"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming\u00a063(1), 131\u2013173 (2005)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"03","key":"9_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0960129506005263","volume":"16","author":"S.J. Gay","year":"2006","unstructured":"Gay, S.J., Nagarajan, R.: Types and typechecking for communicating quantum processes. Mathematical Structures in Computer Science\u00a016(03), 375\u2013406 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Palsberg, J., Abadi, M. (eds.) Proc. POPL 2005, pp. 145\u2013157 (2005)","DOI":"10.1145\/1047659.1040318"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. ACM STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"78","author":"L.K. Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters\u00a078(2), 325 (1997)","journal-title":"Physical Review Letters"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BF01642508","volume":"3","author":"M. Hennessy","year":"1991","unstructured":"Hennessy, M.: A proof system for communicating processes with value-passing. Formal Aspects of Computer Science\u00a03, 346\u2013366 (1991)","journal-title":"Formal Aspects of Computer Science"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.1993.1067","volume":"107","author":"M. Hennessy","year":"1993","unstructured":"Hennessy, M., Ing\u00f3lfsd\u00f3ttir, A.: A theory of communicating processes value-passing. Information and Computation\u00a0107(2), 202\u2013236 (1993)","journal-title":"Information and Computation"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Tokoro, M.: On reduction-based process semantics. Theoretical Computer Science\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science\u00a01(1:4) (2005)","DOI":"10.2168\/LMCS-1(1:4)2005"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Jorrand, P., Lalire, M.: Toward a quantum process algebra. In: Proceedings of the 1st Conference on Computing Frontiers, pp. 111\u2013119. ACM (2004)","DOI":"10.1145\/977091.977108"},{"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. Mathematical Structures in Computer Science\u00a016(3), 407\u2013428 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR23","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I and II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"9_CR25","unstructured":"Nielsen, M., Chuang, I.: Quantum computation and quantum information. Cambridge University Press (2000)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-85361-9_36","volume-title":"CONCUR 2008 - Concurrency Theory","author":"J. Rathke","year":"2008","unstructured":"Rathke, J., Soboci\u0144ski, P.: Deriving Structural Labelled Transitions for Mobile Ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 462\u2013476. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Proc. LICS 2007, pp. 293\u2013302. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.17"},{"key":"9_CR29","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete log and factoring. In: Proc. FOCS 1994, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1507244.1507249","volume":"10","author":"M. Ying","year":"2009","unstructured":"Ying, M., Feng, Y., Duan, R., Ji, Z.: An algebra of quantum processes. ACM Transactions on Computational Logic\u00a010(3), 1\u201336 (2009)","journal-title":"ACM Transactions on Computational Logic"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T01:50:38Z","timestamp":1744077038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}