The C&O Department has 30 faculty members and 45 graduate students. It is intensely research oriented and holds a strong international reputation in each of its six major areas: Algebraic Combinatorics, Combinatorial Optimization, Continuous Optimization, Cryptography, Graph Theory, and Quantum Computing.

More information about research at the Department of Combinatorics and Optimization can be found here.

The IQC Faculty based within C&O are:
Prof. Andrew Childs
Prof. Debbie Leung
Prof. Michele Mosca
Prof. Ashwin Nayak.

IQC Faculty who are cross-appointed members of C&O include:
Prof. Richard Cleve (David Cheriton School of Computer Science)

IQC Affiliates who are members of C&O include:
Dr. Daniel Gottesman (adjunct member, from Perimeter Institute)
Prof. Alfred Menezes.

The various graduate programs offered through C&O include the MMath, by coursework or thesis, and with several choices of core requirements, including a quantum information core. The PhD program has various requirements, including a comprehensive examination in which the student must write one exam from two of the following three categories:

1) Combinatorial Enumeration, Graph Theory
2) Continuous Optimization, Discrete Optimization
3) Cryptography, Quantum Computing

More information on the various programs is available here .