Types and typechecking for Communicating Quantum Processes

Mathematical Structures in Computer Science

Volumn 16, Issue 3, 2006, Pages 375-406

  Gay, Simon J ^a   Nagarajan, Rajagopal ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750742755     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005263     Document Type: Conference Paper

References (42)

1. Abramsky, S. and Coecke, B. (2004) A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society. (Also available as arXiv:quant-ph/0402130.)
2. Adão, P. and Mateus, P. (2005) A process algebra for reasoning about quantum security. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science (to appear).
3. Bennett, C. H. and Brassard, G. (1984) Quantum Cryptography: Public-key Distribution and Coin Tossing. In: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, Bangalore, India, 175-179.
4. Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A. and Wootters, W. K. (1993) Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70 1895-1899.
5. Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L. and Pardo, J.J. (2003) Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming 55 57-103.
6. Cleaveland, R. and Sims, S. (1996) The NCSU concurrency workbench. In: Computer Aided Verification: 8th International Conference, CAV'96. Springer-Verlag Lecture Notes in Computer Science 1102.
7. de Riedmatten, H., Marcikic, I., Tittel, W., Zbinden, H., Collins, D. and Gisin, N. (2004) Long distance quantum teleportation in a quantum relay configuration. Physical Review Letters 92 (4) 047904.
8. Elliott, C. (2004) The DARPA quantum network. arXiv:quant-ph/0412029.
9. Elliott, C. (2005) Current status of the DARPA quantum network. arXiv:quant-ph/0503058.
10. Ennals, R., Sharp, R. and Mycroft, A. (2004) Linear types for packet processing. In: Proceedings of the European Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 2986.
11. Gay, S. J. (2005) Quantum programming languages: survey and bibliography. Bulletin of the European Association for Theoretical Computer Science 86 176-196. (Online bibliography at www.dcs.gla.ac.uk/~simon/quantum.)
12. Gay, S. J., Nagarajan, R. and Papanikolaou, N. (2005) Probabilistic model-checking of quantum protocols. arXiv:quant-ph/0504007.
13. Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50 (1) 1-102.
14. Gottesman, D. and Chuang, I. (1999) Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402 390-393. (Also available as arXiv:quant-ph/9908010.)
15. Gruska, J. (1999) Quantum Computing, McGraw-Hill.
16. Jorrand, P. and Lalire, M. (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, TUCS General Publications 33, Turku Centre for Computer Science. (Also available as arXiv:quant-ph/0407005.)
17. Knill, E. (1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.
18. Kobayashi, N., Pierce, B.C. and Turner, D.N. (1999) Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems 21 (5) 914-947.
19. Kwiatkowska, M. Z., Norman, G. and Parker, D. (2002) PRISM: Probabilistic symbolic model checker. In: Computer Performance Evaluation: Modelling Techniques and Tools; 12th International Conference (TOOLS'02). Springer-Verlag Lecture Notes in Computer Science 2324 200-204.
20. Lalire, M. (2006) Relations among quantum processes: bisimilarity and congruence. Mathematical Structures in Computer Science 16 (3) (this issue).
21. Lo, H.-K. and Chau, H.F. (1997) Is quantum bit commitment really possible? Physical Review Letters 78 (17) 3410-3413.
22. Mackie, I. (1994) Lilac : A functional programming language based on linear logic. Journal of Functional Programming 4 (4) 1-39.
23. Mayers, D. (1997) Unconditionally secure quantum bit commitment is impossible. Physical Review Letters 78 (17) 3414-3417.
24. Mayers, D. (2001) Unconditional Security in Quantum Cryptography. Journal of the ACM 48 (3) 351-406.
25. Meyer, D. A. (1999) Quantum strategies. Physical Review Letters 82 (5) 1052-1055.
26. Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes, I and II, Information and Computation 100 (1) 1-77.
27. Nagarajan, R. and Gay, S.J. (2002) Formal verification of quantum protocols. arXiv:quant-ph/0203086.
28. Nagarajan, R., Papanikolaou, N., Bowen, G. and Gay, S. (2005) An automated analysis of the security of quantum key distribution. In: Proceedings of the 3rd International Workshop on Security Issues in Concurrency. Electronic Notes in Theoretical Computer Science. (Also available as arXiv:cs.CR/0502048.)
29. Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
30. Ömer, B. (2000) Quantum Programming in QCL. Master's thesis, Technical University of Vienna.
31. Papanikolaou, N. K. (2004) Techniques for Design and Validation of Quantum Protocols. Master's thesis, University of Warwick.
32. Pierce, B.C. and Sangiorgi, D. (1996) Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6 (5) 409-454.
33. Poppe, A., Fedrizzi, A., Ursin, R., Böhm, H. R., Lorünser, T., Maurhardt, O., Peev, M., Suda, M., Kurtsiefer, C., Weinfurter, H., Jennewein, T. and Zeilinger, A. (2004) Practical quantum key distribution with polarization entangled photons. Optics Express 12 3865-3871.
34. Rieffel, E. G. and Polak, W. (2000) An introduction to quantum computing for non-physicists. ACM Computing Surveys 32 (3) 300-335.
35. Ryan, P., Schneider, S., Goldsmith, M., Lowe, G. and Roscoe, B. (2001) Modelling and Analysis of Security Protocols, Addison-Wesley.
36. Sanders, J.W. and Zuliani, P. (2000) Quantum programming. In: Mathematics of Program Construction: 5th International Conference. Springer-Verlag Lecture Notes in Computer Science 1837.
37. Sangiorgi, D. and Walker, D. (2001) The π-calculus: a Theory of Mobile Processes, Cambridge University Press.
38. Selinger, P. (2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14 (4) 527-586.
39. Takeuchi, K., Honda, K. and Kubo, M. (1994) An interaction-based language and its typing system. In: PARLE '94: Parallel Architectures and Languages Europe. Springer-Verlag Lecture Notes in Computer Science 817.
40. Valiron, B. (2004) Quantum typing. In: Selinger, P. (ed.) Proceedings of the 2nd International Workshop on Quantum Programming Languages, TUCS General Publications 33, Turku Centre for Computer Science.
41. van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM Journal on Computing 33(5) 1109-1135.
42. Wright, A. K. and Felleisen, M. (1994) A syntactic approach to type soundness. Information and Computation 115 (1) 38-94.