Abstract
Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the other hand, quantum protocol designers may commit more faults than classical protocol designers since human intuition is poorly adapted to the quantum world. To offer formal techniques for modeling and verification of quantum protocols, several quantum extensions of process algebra have been proposed. An important issue in quantum process algebra is to discover a quantum generalization of bisimulation preserved by various process constructs, in particular, parallel composition, where one of the major differences between classical and quantum systems, namely quantum entanglement, is present. Quite a few versions of bisimulation have been defined for quantum processes in the literature, but in the best case they are only proved to be preserved by parallel composition of purely quantum processes where no classical communication is involved.
Many quantum cryptographic protocols, however, employ the LOCC (Local Operations and Classical Communication) scheme, where classical communication must be explicitly specified. So, a notion of bisimulation preserved by parallel composition in the circumstance of both classical and quantum communication is crucial for process algebra approach to verification of quantum cryptographic protocols. In this article we introduce novel notions of strong bisimulation and weak bisimulation for quantum processes, and prove that they are congruent with respect to various process algebra combinators including parallel composition even when both classical and quantum communication are present. We also establish some basic algebraic laws for these bisimulations. In particular, we show the uniqueness of the solutions to recursive equations of quantum processes, which proves useful in verifying complex quantum protocols. To capture the idea that a quantum process approximately implements its specification, and provide techniques and tools for approximate reasoning, a quantified version of strong bisimulation, which defines for each pair of quantum processes a bisimulation-based distance characterizing the extent to which they are strongly bisimilar, is also introduced.
- Abadi, M. and Gordon, A. D. 1997. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the 4th ACM Conference on Computer and Communications Security. ACM, 36--47. Google Scholar
Digital Library
- Baier, C. and Hermanns, H. 1997. Weak bisimulation for fully probabilistic processes. In Proceedings of the International Conference on Computer Aided Verification (CAV’97). Lecture Notes in Computer Science, vol. 1254, Springer, 119--130. Google Scholar
Digital Library
- Baier, C. and Kwiatkowska, M. 2000. Domain equations for probabilistic processes. Math. Struct. Comput. Sci. 10, 665--717. Google Scholar
Digital Library
- Bennett, C. H. and Wiesner, S. J. 1992. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69, 20, 2881--2884.Google Scholar
Cross Ref
- Bennett, C. H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., and Wootters, W. 1993. Teleporting an unknown quantum state via dual classical and EPR channels. Phys. Rev. Lett. 70, 1895--1899.Google Scholar
Cross Ref
- Deng, Y. and Du, W. 2011. Logical, metric, and algorithmic characterisations of probabilistic bisimulation. arxiv:1103.4577v1 {cs.lo}.Google Scholar
- Deng, Y., Palamidessi, C., and Pang, J. 2005. Compositional reasoning for probabilistic finite-state behaviors. In Processes, Terms and Cycles: Steps on the Road to Infinity. 309--337. Google Scholar
Digital Library
- Deng, Y., Chothia, T., Palamidessi, C., and Pang, J. 2006. Metrics for action-labelled quantitative transition systems1. Electron. Not. Theor. Comput. Sci. 153, 2, 79--96. Google Scholar
Digital Library
- Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C., and Zhang, C. 2007. Remarks on testing probabilistic processes. Electron. Not. Theor. Comput. Sci. 172, 359--397. Google Scholar
Digital Library
- Desharnais, J., Gupta, V., Jagadeesan, R., and Panangaden, P. 2002. Weak bisimulation is sound and complete for PCTL*. In Proceedings of the International Conference on Concurrency Theory (CONCUR). 355--370. Google Scholar
Digital Library
- Desharnais, J., Gupta, V., Jagadeesan, R., and Panangaden, P. 2004. Metrics for labelled markov processes. Theor. Comput. Sci. 318, 3, 323--354. Google Scholar
Digital Library
- Desharnais, J., Gupta, V., Jagadeesan, R., and Panangaden, P. 2010. Weak bisimulation is sound and complete for PCTL*. Inf. Comput. 208, 2, 203--219.Google Scholar
Cross Ref
- Feng, Y., Duan, R., Ji, Z., and Ying, M. 2007. Probabilistic bisimulations for quantum processes. Inf. Comput. 205, 11, 1608--1639. Google Scholar
Digital Library
- Feng, Y., Duan, R., and Ying, M. 2011. Bisimulations for quantum processes. In Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL’11), M. Sagiv Ed., 523--534. Google Scholar
Digital Library
- Gay, S. J. and Nagarajan, R. 2005. Communicating quantum processes. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). J. Palsberg and M. Abadi Eds., 145--157. Google Scholar
Digital Library
- Giacalone, A., Jou, C., and Smolka, S. 1990. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of the IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods. North-Holland, Amsterdam, 443--458.Google Scholar
- Grover, L. K. 1997. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 78, 2, 325.Google Scholar
- Hennessy, M. 1991. A proof system for communicating processes with value-passing. Formal Aspects of Comput. Sci. 3, 346--366.Google Scholar
Cross Ref
- Hennessy, M. and Ingólfsdóttir, A. 1993. A theory of communicating processes with value-passing. Inf. Comput. 107, 2, 202--236. Google Scholar
Digital Library
- Jorrand, P. and Lalire, M. 2004. Toward a quantum process algebra. In Proceedings of the 2nd International Workshop on Quantum Programming Languages. P. Selinger Ed., 111. Google Scholar
Digital Library
- Kitaev, A. 1997. Quantum computations: Algorithms and error correction. Russ. Math. Surv. 52, 6, 1191--1249.Google Scholar
Cross Ref
- Kraus, K. 1983. States, Effects and Operations: Fundamental Notions of Quantum Theory. Springer, Berlin.Google Scholar
- Lalire, M. 2006. Relations among quantum processes: Bisimilarity and congruence. Math. Struct. Comput. Sci. 16, 3, 407--428. Google Scholar
Digital Library
- Milner, R. 1989. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ. Google Scholar
Digital Library
- Milner, R., Parrow, J., and Walker, D. 1992. A calculus of mobile processes, parts I and II. Inf. Comput. 100, 1--77.Google Scholar
Digital Library
- Nielsen, M. and Chuang, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press. Google Scholar
Digital Library
- Shor, P. W. 1994. Algorithms for quantum computation: Discrete log and factoring. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS’94). 124--134. Google Scholar
Digital Library
- van Breugel, F. 2010. http://www.sti.uniurb.it/events/sfm10qapl/slides/franck-part1.pdf.Google Scholar
- von Neumann, J. 1955. Mathematical Foundations of Quantum Mechanics. Princeton University Press, Princeton, NJ.Google Scholar
- Ying, M., Feng, Y., Duan, R., and Ji, Z. 2009. An algebra of quantum processes. ACM Trans. Comput. Logic 10, 3, 1--36. Google Scholar
Digital Library
- Ying, M. S. 2001. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer New York. Google Scholar
Digital Library
- Ying, M. S. 2002. Bisimulation indexes and their applications. Theor. Comput. Sci. 275, 1--68. Google Scholar
Digital Library
Index Terms
Bisimulation for Quantum Processes
Recommendations
An algebra of quantum processes
We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of ...
Bisimulation for quantum processes
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesQuantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the ...
Bisimulation for quantum processes
POPL '11Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the ...








Comments