Relations among quantum processes: Bisimilarity and congruence

Mathematical Structures in Computer Science

Volumn 16, Issue 3, 2006, Pages 407-428

  Lalire, Marie ^a  

^a Leibniz Laboratory   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750721335     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012950600524X     Document Type: Conference Paper

References (19)

1. Andova, S. (1999) Process algebra with probabilistic choice. Springer-Verlag Lecture Notes in Computer Science 1601 111-129.
2. Arrighi, P. and Dowek, G. (2004) Operational semantics for formal tensorial calculus. In: Selinger, P. (ed.) Proceedinga of the 2nd International Workshop on Quantum Programming Languages 21-38.
3. Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A. and Wootters, W. (1993) Teleporting an unknown quantum state via dual classical and EPR channels. Physical Review Letters 70 1895-1899.
4. Bolognesi, T. and Brinksma, E. (1987) Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems 14 (1) 25-59.
5. Cazorla, D., Cuartero, F., Valero, V. and Pelayo, F. L. (2001) A process algebra for probabilistic and nondeterministic processes. Information Processing Letters 80 (1) 15-23.
6. Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L and Pardo, J. (2003) Algebraic theory of probabilistic and nondeterministic processes. The Journal of Logic and Algebraic Programming 55 (1-2) 57-103.
7. Fokkink, W. (2000) Introduction to Process Algebra, Springer.
8. Lalire, M. and Jorrand, P. (2004) A process algebraic approach to concurrent and distributed quantum computation: operational semantics. In: Selinger, P. (ed.) Proceedings of the 2nd International Workshop on Quantum Programming Languages 109-126.
9. Milner, R. (1989) Communication and Concurrency, Prentice-Hall.
10. Nagarajan, R. and Gay, S. (2004) Communicating quantum processes. In: Selinger, P. (ed.) Proceedings of the 2nd International Workshop on Quantum Programming Languages 91-107.
11. Nielsen, M. (2001) Universal quantum computation using only projective measurement, quantum memory and preparation of the 0 state. Los Alamos e-print arXiv.
12. Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
13. Ömer, B. (2000) Quantum programming in QCL. Master's thesis, Institute of Information Systems, Technical University of Vienna.
14. Perdrix, S. (2004) State transfer instead of teleportation in measurement-based quantum computation. Los Alamos e-print arXiv.
15. Roscoe, A. W. (1998) The theory and practice of concurrency, Prentice-Hall.
16. Selinger, P. (2004) Toward a quantum programming language. Mathematical Structures in Computer Science 14 (4) 525-586.
17. van Glabbeek, R. (1993) The linear time - branching time spectrum ii: the semantics of sequential systems with silent moves. In: Best, E. (ed.) Proceedings of the 4th Conference on Concurrency Theory (CONCUR'93), Hildesheim. Springer-Verlag Lecture Notes in Computer Science 715. 66-81.
18. Van Tonder, A. (2003) A lambda calculus for quantum computation. Los Alamos e-print arXiv.
19. Zuliani, P. (2001) Quantum Programming, Ph.D. thesis, St Cross College, University of Oxford.