
Invited talks are 45 minutes long, plus 5 minutes for questions. Contributed talks will be 12 minutes long, plus 3 minutes for questions.
Lunch is provided only on Sunday, January 18 (courtesy of RIM).
Click here for a list of options for lunch on the other days.
Thursday through Sunday, all talks will be held at the CIGI building. The Monday session will be held at the Waterloo Inn. Transportation will be provided from the Waterloo Inn to CIGI and back; click here for details.
Click here to see a list of talks that have been made available.
| Wednesday, Jan. 14: | |
| 8:00 PM - 10:00 PM | Wine & cheese reception (Waterloo Inn) |
| Thursday, Jan. 15: | |
| 9:00 - 9:20 | Introduction Morning session: Chair Raymond Laflamme |
| 9:20 - 10:10 | Cleve “Consequences and limits of nonlocal strategies” |
| 10:10 - 10:30 | Break |
| 10:30 - 11:20 | Watrous “Stronger error reduction for QMA” |
| 11:20 - 12:10 | Tamaki “Unconditional security of the Bennett 1992 quantum key |
| 12:10 - 2:00 | Lunch Afternoon session: Chair Barbara Terhal |
| 2:00 - 2:50 | Valiant “Holographic algorithms” |
| 2:50 - 3:40 | Aaronson “Multilinear formulas and skepticism of quantum computing” |
| 3:40 - 4:10 | Break |
| 4:10 - 5:00 | Raz
“Multi-linear formulas for permanent and determinant are of super-polynomial
size” |
| 8:00 | Reception/Party (Perimeter Institute) |
| Friday, Jan. 16: | |
| Morning session: Chair Harry Buhrman | |
| 9:00 - 9:50 | Kuperberg “A subexponential-time quantum algorithm for the dihedral hidden subgroup problem” |
| 9:50 - 10:20 | Break |
| 10:20 - 11:10 | Russell “Quantum computation in groups” |
| 11:10 - 12:00 | Aharonov “On the universality of adiabatic quantum computation” |
| 12:00 - 2:00 | Lunch Afternoon session: Chair Isaac Chuang |
| 2:00 - 2:50 | Brassard “Quantum foundations in the light of quantum information” |
| 2:50 - 3:40 | Massar “Non-locality” |
| 3:40 - 4:10 | Break |
| 4:10 - 5:00 | Kempe “Symmetric group problems” |
| 7:30 | Hockey game (Kitchener Rangers vs. Barrie Colts; click here for details.) |
| Saturday, Jan. 17: | |
| Morning session: Chair Claude Crepeau | |
| 9:00 - 9:50 | Maurer “On the power of quantum memory” |
| 9:50 - 10:20 | Break |
| 10:20 - 11:10 | Leung “Applications of the quantum composability theorem” |
| 11:10 - 12:00 | Schulman “Physical limits of heat-bath algorithmic cooling” |
| 12:00 - 2:00 | Lunch Afternoon session: Chair Daniel Gottesman Contributed session I (4 talks) |
| 2:00 - 2:15 | Christandl “A new generic proof for the security of quantum key distribution” |
| 2:15 - 2:30 | Sanders “Sharing secret quantum states: theory and experiment” |
| 2:30 - 2:45 | Harrow “Coherent communication of classical messages” |
| 2:45 - 3:00 | Poulin “Exponential speed-up with a single bit of quantum information: Testing the quantum butterfly effect” |
| 3:00 - 3:20 | Break Contributed session II (3 talks) |
| 3:20 - 3:35 | Fuentes “Holonomic quantum computation in the presence of decoherence” |
| 3:35 - 3:50 | Terno “Quantum information and special relativity” |
| 3:50 - 4:05 | Kauffman “Braiding operators and quantum computing” |
| 4:05 - 6:00 | Poster Session |
| Sunday, Jan. 18: | |
| Morning session: Chair Miklos Santha | |
| 9:00 - 9:50 | Radhakrishnan “The bounded-round quantum communication complexity of set disjointness” |
| 9:50 - 10:20 | Break |
| 10:20 - 11:10 | Kerenidis “Exponential separation of quantum and classical one-way communication complexity” |
| 11:10 - 12:00 | Klauck “Tradeoffs between the communication complexity and the number of storage qubits” |
| 12:00 - 2:00 | Conference
Lunch (sponsored by RIM, location CIGI building) Afternoon session: Chair Ashwin Nayak |
| 2:00 - 2:50 | Ambainis “Quantum walk algorithms: element distinctness and spatial search” |
| 2:50 - 3:40 | Magniez “Quantum algorithms for the triangle problem” |
| 3:40 - 4:10 | Break Contributed session III (3 talks) |
| 4:10 - 4:25 | Durr “Quantum query complexity of some graph problems” |
| 4:25 - 4:40 | Barnum “Query complexity & semidefinite programming” |
| 4:40 - 4:55 | Laplante “Lower bounds for randomized and quantum query complexity using Kolmogorov arguments” |
| 6:30 | Banquet (Waterloo Inn) |
| Monday,
Jan. 19: (Waterloo Inn) |
|
| Morning session: Chair Michele Mosca | |
| 9:00 - 9:50 | Regev “Recent connections between quantum computation and lattice problems” |
| 9:50 - 10:20 | Break |
| 10:20 - 11:10 | Winter "From entanglement to secret key and back" |
| 11:10 - 12:00 | Shor "Additivity questions in quantum information theory" |
| 12:00 - 12:15 | Closing remarks |