| |
Quantum Algorithms and Complexity |
| September 23, 2002 to September 27, 2002 |
| Organized By: Richard Cleve, Peter Shor, and Umesh Vazirani |
| |
| Parent Programs: |
| Quantum Computation |
| |
| Participant List: |
| View a List of Registered Participants |
| |
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 |
| |
|
| |
|
| |
|
For more information:
Questions about this workshop should be sent either by email to
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.
|
| |
| Back to Workshop Listing |
