Site Search
Main Participants Wiki Discussions
Quantum Algorithms and Complexity
Sep 23, 2002 to Sep 27, 2002

Organizer(s)

Richard Cleve, Peter Shor, and Umesh Vazirani

Contact

REGISTRATION IS CLOSED

To be held at the Banff Conference Centre in Banff (Alberta), Canada

This workshop will include models for quantum computation, quantum algorithms (including quantum fourier transforms, period finding, hidden subgroup problems), quantum complexity theory (including quantum complexity classes, quantum lower-bounds, quantum communication complexity, quantum NP-completeness and quantum interactive proofs), Fault-tolerance (including quantum error-correction, concatenation codes, decoherence-free subspaces).

Please note that the number of participants for this workshop, including those who are self-funded, will be limited due to space constraints at the Banff Centre. At this time very few openings remain.

REGISTRATION IS CLOSED



Group photo of participants

Important

Schedule
Monday, September 23, 2002
9:20AM - 9:30AM Loa Nowina-Sapinski Welcome
9:30AM - 10:30AM Sean Hallgren Polynomial-time quantum algorithms for Pell's Equation and the principal ideal problem
10:30AM - 11:00AM Marsha Borg Morning Coffee Break
11:00AM - 11:30AM Miklos Santha An efficient quantum algorithm for the hidden translation problem
11:30AM - 5:15PM Marsha Borg Lunch and informal meetings
5:15PM - 6:00PM Marsha Borg Afternoon Coffee Break
6:00PM - 7:00PM John Watrous TBA
Tuesday, September 24, 2002
9:30AM - 10:30AM Scott Aaronson Quantum lower bounds you haven't seen before
10:30AM - 11:00AM Marsha Borg Morning Coffee Break
11:00AM - 11:30AM Yaoyun Shi Review of lower bounds for the collision problem
11:30AM - 5:15PM Marsha Borg Lunch and informal meetings
5:15PM - 6:00PM Marsha Borg Afternoon Coffee Break
6:00PM - 7:00PM Oded Regev Quantum computation and lattice problems
Wednesday, September 25, 2002
9:30AM - 10:30AM Dorit Aharonov Quantum sampling, SZK and Markov chains: A different framework for quantum algorithms
10:30AM - 11:00AM Marsha Borg Morning Coffee Break
11:00AM - 11:30AM Willem van Dam Efficient quantum algorithms for estimating Gauss sums (with Gadiel Seroussi)
Thursday, September 26, 2002
9:30AM - 10:30AM Mario Szegedy Quantum decision trees and semidefinite programming
10:30AM - 11:00AM Marsha Borg Morning Coffee Break
11:00AM - 11:45AM Ronald de Wolf Quantum computing and locally decodable codes
11:45AM - 5:15PM Marsha Borg Lunch and informal meetings
5:15PM - 6:00PM Marsha Borg Afternoon Coffee Break
6:00PM - 7:00PM Andris Ambainis Quantum communication complexity of set disjointness
Friday, September 27, 2002
9:30AM - 10:15AM Dave Bacon Digitizing quantum correlations
10:15AM - 10:45AM Marsha Borg Morning Coffee Break
10:45AM - 11:30AM Harry Buhrman Combinatorics and quantum nonlocality
11:30AM - 5:15PM Marsha Borg Lunch and informal meetings
5:15PM - 6:00PM Marsha Borg Afternoon Coffee Break
6:00PM - 7:00PM Tal Mor Quantum computation without entanglement
Parent Program(s):
Quantum Computation


Questions about this workshop should be sent either by email to
202@msri.org

or by regular mail to:
Quantum Algorithms and Complexity
Mathematical Sciences Research Institute
17 Gauss Way, Berkeley, CA
94720-5070.
USA

The Institute is committed to the principles of Equal Opportunity and Affirmative Action.



|