Current graduate students

Monday, June 23, 2014 12:00 am - Friday, June 27, 2014 12:00 am EDT (GMT -04:00)

Algebraic Combinatorics: Spectral Graph Theory, Erdös-Ko-Rado Theorems and Quantum Information Theory

A conference to celebrate the work of Chris Godsil

It is surprising that the characteristic polynomial ofChris Godsil the adjacency matrix of a graph provides a useful window onto combinatorial properties of the graph itself, but this approach to graph theory has been a source of interesting and useful results for over 80 years.

Wednesday, April 9, 2014 3:00 pm - 4:00 pm EDT (GMT -04:00)

Traub: Algorithms and Complexity for Quantum Computing

Joseph F. Traub, Columbia University

We introduce the notion of strong quantum speedup. To compute this
speedup one must know the classical computational complexity. What is it about the problems of quantum physics and quantum chemistry that enable us to get lower bounds on the classical complexity?