Highlights

• Extensive contributions to the theory of interactive proof systems in the presence of quantum information
• First to show that quantum information increases the expressive power of such systems in various contexts
• Contributed significantly to aspects of the theory of the quantum computational complexity and to the theory of quantum algorithms
• Scholar, Canadian Institute for Advanced Research

Research Interests

Research Involves Study of the computational power and limitations of mathematical models of quantum computers.

Research Relevance

Increase the impetus to develop quantum computers and provide greater understanding of their potential.

Quantum Questions

Governed by the laws of quantum mechanics rather than Newtonian physics, quantum computers have the potential to perform feats that are impossible for ordinary computers. This potential has attracted many young researchers, among them Dr. John Watrous whose previous work has uncovered surprising new findings about the power of quantum interactive proof systems.

Dr. Watrous' program as Canada Research Chair in Quantum Algorithms and Complexity will focus on mathematical models of quantum computation, with the aim of discovering new algorithms for quantum computers and developing a theory of interactions among multiple quantum computers. His overarching goals are to better understand quantum computation from a complexity-theoretic point of view and to identify new uses for quantum computational models.

The program has three key objectives: to identify strengths and limitations of quantum computational models, with an emphasis on identifying new uses for quantum computing devices; to identify relationships among quantum and classical models, and complexity classes; and to apply the theory of quantum computation to theoretic questions concerning classical complexity.

Dr. Watrous believes that his research has excellent potential to lead to important discoveries in quantum complexity theory, and to have a significant impact on our understanding of complexity theory and quantum computation in general.