1. E. Ardeshir-Larijani, S. J. Gay & R. Nagarajan (2014): Verification of Concurrent Quantum Protocols by Equivalence Checking. In: Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 8413. LNCS, pp. 500–514, doi:10.1007/978-3-642-54862-8_42.
  2. T. A. S. Davidson, S. J. Gay, R. Nagarajan & I. V. Puthoor (2011): Analysis of a Quantum Error Correcting Code using Quantum Process Calculus. In: Proceedings of the International Workshop on Quantum Physics and Logic (QPL) 95. EPTCS, pp. 67–80, doi:10.4204/EPTCS.95.7.
  3. Timothy A. S. Davidson (2011): Formal Verification Techniques using Quantum Process Calculus. University of Warwick.
  4. Yuan Feng, Runyao Duan & Mingsheng Ying (2011): Bisimulation for quantum processes. In: Proceedings of the 38th Annual ACM Symposium on Principles of Programming Languages. ACM, pp. 523–534, doi:10.1145/1926385.1926446.
  5. S. Franke-Arnold, S. J. Gay & I. V. Puthoor (2013): Quantum process calculus for linear optical computing. In: Proceedings of the 5th Conference on Reversible Computation (RC) 7948. LNCS, pp. 234–246, doi:10.1007/978-3-642-38986-3_19.
  6. Simon J. Gay & Rajagopal Nagarajan (2005): Communicating Quantum Processes. In: Proceedings of the 32nd Annual ACM Symposium on Principles of Programming Languages. ACM, pp. 145–157, doi:10.1145/1040305.1040318.
  7. Simon J. Gay & Rajagopal Nagarajan (2006): Types and Typechecking for Communicating Quantum Processes. Mathematical Structures in Computer Science 16(3), pp. 375–406, doi:10.1017/S0960129506005263.
  8. Rob J. van Glabbeek & W. Peter Weijland (1996): Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), pp. 555–600, doi:10.1145/233551.233556.
  9. IDQ: ID Quantique. Available at
  10. E. Knill, R. Laflamme & G. J. Milburn (2001): A scheme for efficient quantum computation with linear optics. Nature 409, pp. 46, doi:10.1038/35051009.
  11. T. Kubota, Y. Kakutani, G. Kato, Y. Kawano & H. Sakurada (2012): Application of a process calculus to security proofs of quantum protocols. In: Proceedings of WORLDCOMP/FCS2012.
  12. Robin Milner (1989): Communication and Concurrency. Prentice-Hall.
  13. Robin Milner (1999): Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press.
  14. C. R. Myers & R. Laflamme (2005): Linear Optics Quantum Computation: an Overview. arXiv: quant-ph/0512104v1.
  15. M. A. Nielsen & I. L. Chuang (2000): Quantum Computation and Quantum Information. Cambridge University Press.
  16. J. L. O'Brien, G. J. Pryde, A. G. White, T. C. Ralph & D. Branning (2003): Demonstration of an all-optical quantum controlled-NOT gate. Nature 426, pp. 264, doi:10.1038/nature02054.
  17. A. Politi, J. C. F. Matthews & J. L. O'Brien (2009): Shor's Quantum Factoring Algorithm on a Photonic Chip. Science 325, pp. 1221, doi:10.1126/science.1173731.
  18. T. C. Ralph, N. K. Lanford, T. B. Bell & A. G. White (2002): Linear optical controlled-NOT gate in the coincidence basis. Physical Review Letters A 65, pp. 062324–1, doi:10.1103/PhysRevA.65.062324.
  19. Nikola Trčka & Sonja Georgievska (2008): Branching Bisimulation Congruence for Probabilistic Systems. Electronic Notes in Theoretical Computer Science 220(3), pp. 129 – 143, doi:10.1016/j.entcs.2008.11.023.
  20. Andrew K. Wright & Matthias Felleisen (1994): A syntactic approach to type soundness. Information and Computation 115(1), pp. 38–94, doi:10.1006/inco.1994.1093.

Comments and questions to:
For website issues: