Probabilistic bisimulations for quantum processes

Information and Computation

Volumn 205, Issue 11, 2007, Pages 1608-1639

  Feng, Yuan ^a   Duan, Runyao ^a   Ji, Zhengfeng ^b   Ying, Mingsheng ^a  

^a TSINGHUA UNIVERSITY   (China)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

Congruence; Probabilistic bisimulation; Quantum process

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; QUANTUM COMPUTERS; QUANTUM OPTICS; SEMANTICS;

COMPLEX QUANTUM SYSTEMS; CONGRUENCE; DISTRIBUTED QUANTUM COMPUTING; LABELED TRANSITION SYSTEMS; OPERATIONAL SEMANTICS; PROBABILISTIC BISIMULATIONS; QUANTUM PROCESS; UNITARY TRANSFORMATIONS;

QUANTUM THEORY;

EID: 84855190272     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.08.001     Document Type: Article

References (40)

1. C. H. Bennett, Quantum cryptography using any two nonorthogonal states, Physical Review Letters 68 (1992) 3121.
2. C. H. Bennett, G. Brassard, Quantum cryptography: Public-key distribution and coin tossing, in: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, Bangalore, India, 1984, pp. 175-179.
3. C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, W. Wootters, Teleporting an unknown quantum state via dual classical and epr channels, Physical Review Letters 70 (1993) 1895-1899.
4. C. H. Bennett, S. J. Wiesner, Communication via one-and two-particle operators on einstein-podolsky-rosen states, Physical Review Letters 69 (20) (1992) 2881-2884.
5. S. Bettelli, T. Calarco, L. Serafini, Toward an architecture for quantum programming, European Physical Journal D 25 (2) (2003) 181-200. (Pubitemid 37023179)
6. P. J. Bussey, Communication and non-communication in einstein-rosen experiments, Physics Letters A 123 (1987) 1-3.
7. A. K. Ekert, Quantum cryptography based on bell's theorem, Physical Review Letters 67 (1991) 661.
8. R. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21 (1982) 467-488.
9. S. J. Gay, Quantum programming languages: survey and bibliography, Mathematical Structures in Computer Science 16 (04) (2006) 581-600. (Pubitemid 44706982)
10. S. J. Gay, R. Nagarajan, Communicating quantum processes, in:J. Palsberg, M. Abadi (Eds.), Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 2005, pp. 145-157.
11. G. C. Ghirardi, T. Weber, Quantum mechanics and faster-than-light communication methodological considerations, Nuovo Cimento B 11 (78 B) (1983) 9-20.
12. L. K. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of ACM STOC, 1996, pp. 212-219.
13. L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters 78 (2) (1997) 325.
14. M. Hennessy, A proof system for communicating processes with value-passing, Formal Aspects of Computer Science 3 (1991) 346-366.
15. M. Hennessy, A. Ingólfsdóttir, A theory of communicating processes value-passing, Information and Computation 107 (2) (1993) 202-236.
16. P. Jorrand, M. Lalire, Toward a quantum process algebra, in: P. Selinger (Ed.), Proceedings of the 2nd International Workshop on Quantum Programming Languages, 2004, p. 111.
17. E. H. Knill, Conventions for quantum pseudocode, LANL report LAUR-96-2724, 1996.
18. K. Kraus, States, Effects and Operations: Fundamental Notions of Quantum Theory, Springer, Berlin, 1983.
19. Marie Lalire, A probabilistic branching bisimulation for quantum processes, 2005. arxiv:quant-ph/0508116v1 August, 2005.
20. Marie Lalire, Relations among quantum processes: Bisimilarity and congruence, Mathematical Structures in Computer Science 16 (3) (2006) 407-428. (Pubitemid 44706990)
21. K. Larsen, A. Skou, Bisimulation through probabilistic testing, Information and Computation 94 (1991) 456-471.
22. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, parts i and ii, Information and Computation 100 (1992) 1-77.
23. M. Nielsen, Conditions for a class of entanglement transformations, Physical Review Letters 83 (1999) 436-439. (Pubitemid 129689588)
24. Michael Nielsen, Isaac Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
25. B. Ömer, A procedural formalism for quantum computing. Master thesis, Department of Theoretical Physics, Technical University of Vienna, 1998. .
26. B. Ömer, Structured Quantum Programming, Ph. D. thesis, Department of Theoretical Physics, Technical University of Vienna, 2003.
27. A. Poppe, A. Fedrizzi, T. Lorunser, O. Maurhardt, R. Ursin, H. R. Bohm, M. Peev, M. Suda, C. Kurtsiefer, H. Weinfurter, T. Jennewein, A. Zeilinger, Practical quantum key distribution with polarization entangled photons, 2004. arxiv:quant-ph/0404115.
28. J. W. Sanders, P. Zuliani, Quantum programming, Mathematics of Program Construction 1837 (2000) 80-99.
29. R. Segala, N. Lynch, Probabilistic simulations for probabilitsic processes, in: Proceedings of CONCUR'94, Theories of Concurrency Unification and Extension, Lecture Notes in Computer Science, vol. 836, 1994, pp. 481-496.
30. R. Segala, N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing 2 (2) (1995) 250-273.
31. P. Selinger, A brief survey of quantum programming languages, Functional and Logic Programming 2998 (2004) 1-6.
32. P. Selinger, Towards a quantum programming language, Mathematical Structures in Computer Science 14 (4) (2004) 527-586. (Pubitemid 39142159)
33. Peter W. Shor, Algorithms for quantum computation: discrete log and factoring, in: Proceedings of the 35th IEEE FOCS, 1994, pp. 124-134.
34. J. von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton University Press, Princeton, NJ, 1955.
35. W. K. Wootters, W. H. Zurek, A single quantum cannot be cloned, Nature 299 (5886) (1982) 802-803.
36. M. S. Ying, M. Wirsing, Approximate bisimilarity, in: T. Rus (Ed.), Algebraic Methodology and Software Technology, 8th International Conference, Lecture Notes in Computer Science, vol. 1816, Iowa City, USA, 2000, pp. 309-321.
37. M. S. Ying, Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs, Springer-Verlag, New York, 2001.
38. M. S. Ying, Additive models of probabilistic processes, Theoretical Computer Science 275 (2002) 481-519.
39. P. Zuliani, Quantum Programming, Ph. D. thesis, Oxford University, 2001.
40. P. Zuliani, Quantum programming with mixed states, in: Proceedings of the 3rd International Workshop on Quantum Programming Languages, Chicago, 2005.