The Program as it Appears so Far

This page contains the list of talks already received. You can follow the hyperlinks to get the abstract description and more information. Make sure you got the updated version by using the reload button.



Quantum Counting

Authors:Gilles Brassard [ Universite de Montreal (LITQ),brassard@iro.umontreal.ca]
Peter Hoyer [ Odense University (IMADA),u2pi@imada.ou.dk]
Alain Tapp [ Universite de Montreal (LITQ),tappa@iro.umontreal.ca ]

Conjugated Operators in Quantum Algorithms

Authors:Peter Hoyer [ Odense University,u2pi@imada.ou.dk]

Quantum Computing and Counting Complexity

Authors:Lance Fortnow [ University of Chicago,fortnow@cs.uchicago.edu]

Classical Foundations of Oblivious Transfer

Authors:Christian Cachin [ MIT,http://theory.lcs.mit.edu/~cc]

Quantum computation of Fourier transforms over symmetric groups

Authors:Robert Beals [ University of Arizona,beals@math.arizona.edu]

Computation of polynomial invariants of quantum states and quantum codes

Authors:Markus Grassl [ IAKS, University of Karlsruhe,grassl@ira.uka.de]
Thomas Beth [ IAKS, University of Karlsruhe,EISS_Office@ira.uka.de]
Martin Roetteler [ IAKS, University of Karlsruhe,roettele@ira.uka.de]

Relationships between quantum and classical space-bounded complexity classes

Authors:John Watrous [ University of Wisconsin,watrous@cs.wisc.edu]

Multiparty Quantum Communication Complexity

Authors:Wim van Dam [ University of Oxford/CWI Amsterdam,wimvdam@mildred.physics.ox.ac.uk]
Peter Hoyer [ Odense University,u2pi@imada.ou.dk]
Alain Tapp [ Universite de Montreal,tappa@iro.umontreal.ca]

Quantum Bit Commitment from a Physical Assumption

Authors:Louis Salvail [ BRICS,salvail@brics.dk]

Quantum Entanglement Purification

Authors:Charles H. Bennett [ T.J. Watson Laboratories,bennetc@watson.ibm.com]
Gilles Brassard [ Universite de Montreal,brassard@iro.umontreal.ca]
Sandu Popescu [ Newton Institute,s.popescu@newton.cam.ac.uk]
Benjamin Schumacher [ Kenyon College,schumacb@kenyon.edu]
John A. Smolin [ T.J. Watson Laboratories,clsmolin@watson.ibm.com]
William K. Wootters [ Williams College,William.K.Wootters@williams.edu]

Complexity limitations on quantum computation

Authors:Lance Fortnow [ University of Chicago,fortnow@cs.uchicago.edu]
John Rogers [ DePaul University,rogers@cs.depaul.edu]

Quantum Communication Complexity

Authors:Harry Buhrman [ CWI, Amsterdam, The Netherlands,buhrman@cwi.nl]

Quantum Computer Algorithms and Interferometry

Authors:Michele Mosca [ University of Oxford,mosca@maths.ox.ac.uk]

Quantum Computation and Communication

Authors:Richard Cleve [ University of Calgary,cleve@cpsc.ucalgary.ca]

Quantum Robots and Quantum Computers

Authors:Paul Benioff [ Argonne National Lab, Argonne IL USA,pbenioff@anl.gov]
(canceled)
Simulating quantum operations with mixed environments

Authors:Isaac L. Chuang [ Los Alamos National Laboratory,ike@isl.stanford.edu]
David P. DiVincenzo [ IBM T.J.Watson Research Center,divince@watson.ibm.com]
John A. Smolin [ IBM T.J.Watson Research Center,smolin@watson.ibm.com]
Barbara M. Terhal [ University of Amsterdam,terhal@phys.uva.nl]

Noisy Quantum Computation- Solved Problems, Open Problems

Authors:Dorit Aharonov [ Hebrew University,doria@cs.huji.ac.il]

On Noncommutative Hidden Subgroups

Authors:Mark Ettinger [ Los Alamos National Laboratory,ettinger@lanl.gov]

Quantum attacks on classical bit commitment schemes

Authors:Gilles Brassard [ Université de Montréal,brassard@iro.umontreal.ca]
Claude Crépeau [ Université de Montréal,crepeau@iro.umontreal.ca]
Dominic Mayers [ Princeton University,mayers@cs.princeton.edu]
Louis Salvail [ BRICS,salvail@daimi.aau.dk]

How much information can one touch in k qbits ?

Authors:Amnon Ta-Shma [ ICSI,amnon@icsi.berkeley.edu]
Umesh Vazirani [ Berkeley,vazirani@cs.berkeley.edu]

Quantum key distribution is unconditionally secure.

Authors:Dominic Mayers [ Princeton,mayers@cs.princeton.edu]
Andrew Yao [ Princeton,yao@cs.princeton.edu]

Quantum Effects in Algorithms

Authors:Richard Jozsa [ University of Plymouth,rjozsa@plymouth.ac.uk]

Almost any quantum mechanical system can perform rapid search

Authors:Lov K. Grover [ Lucent,lkg@mhcnet.lucent.com]

Alice, Bob and Eve in Quantumland

Authors:Tal Mor [ Université de Montréal (LITQ),mor@iro.umontreal.ca]

Quantum Channel Capacities

Authors:John Smolin [ T.J. Watson Laboratories,clsmolin@watson.ibm.com]

Quantum and Classical Information: Interactions and Reductions

Authors:Charles H. Bennett [ T.J. Watson Laboratories,bennetc@watson.ibm.com]

Quantum Lower Bounds by Polynomials

Authors:Robert Beals [ University of Arizona,beals@math.arizona.edu]
Harry Buhrman [ CWI,buhrman@cwi.nl]
Richard Cleve [ University of Calgary,cleve@cpsc.ucalgary.ca]
Michele Mosca [ University of Oxford,mosca@maths.ox.ac.uk]
Ronald de Wolf [ CWI,rdewolf@cwi.nl]