| Morning session Chair: Harry Buhrman |
9:00am-9:50am | Jordan
Kerenidis -
On the power of quantum multiparty communication complexity
|
9:50am-10:20am | Break
|
10:20am-11:10am | Yaoyun Shi
- Tensor norms and the classical communication complexity of
nonlocal quantum measurement
|
11:10am-12:00pm | Oded Regev
- On Lattices, Learning with Errors, Random Linear Codes, and
Cryptography
|
12:00pm- 2:00pm | Lunch
|
| Afternoon session Chair: Isaac Chuang |
| Contributed talks II
|
2:00pm-2:20pm | Joseph Traub - Algorithms and Complexity for Continuous Problems
|
2:20pm-2:40pm | Dimitry Gavinsky - Quantum Communication Cannot Simulate a Public
Coin
|
2:40pm-3:00pm | Seiichiro Tani - Exact Quantum Algorithms for the Leader Election
Problem
|
3:00pm-3:20pm | Jean-Christian Boileau - Performance of the Three State Quantum Key
Distribution Protocol
|
3:20pm-3:40pm | John Yard - Capacity theorems for quantum multiple access
channels
|
4pm-6pm | Poster session
We will provide 36" x 48" boards on which your posters
(which can be taller, but not wider) may be mounted.
|
7pm | Open for group event(s)
|