Skip to content

John Watrous


  • Fellow
  • Quantum Information Science




John Watrous is a computer scientist whose research focuses on the theory of quantum information and its applications to algorithms, complexity theory and cryptography.

Currently, his specific interests include quantum interactive proof systems and zero-knowledge, quantum algorithms for group-theoretic problems, quantum analogues of random walks and Markov chains, and the theory of entanglement. Watrous is also interested in algorithms, complexity theory and theoretical computer science more generally.


  • Discovery Accelerator Supplement, 2014
  • Canada Research Chair in Quantum Computing, 2002–06

Relevant Publications

  • Jain, R. et al. "QIP = PSPACE." J. ACM 39, no. 1 (2009): 25–58.
  • Watrous, J. "Zero-knowledge against quantum attacks." SIAM J. Comput. 39, no. 1 (2009): 25–58.
  • Marriott, C., and J. Watrous. "Quantum Arthur-Merlin games." Computational Complexity 14, no. 2 (2005): 122–52.

Support Us

CIFAR is a registered charitable organization supported by the governments of Canada, Alberta and Quebec, as well as foundations, individuals, corporations and Canadian and international partner organizations.

MaRS Centre, West Tower
661 University Ave., Suite 505
Toronto, ON M5G 1M1 Canada