Friday, December 13, 2002 – Tuesday, December 17, 2002 · MSRI, Berkeley, California
MSRI has chartered the UC Berkeley Hill Shuttle bus for Saturday and Sunday. It will run on the regular weekday schedule, but starting a little later (first bus leaves the Mining Circle at 8:15am) and ending earlier (last bus leaves MSRI at 5:30pm). Invited Speakers include: Dorit Aharonov, Gilles Brassard, Charles Bennett, Michael Ben-Or, Claude Crepeau, Wim van Dam, Ronald de Wolf, Edward Farhi, Sean Hallgren, Patrick Hayden, Rahul Jain, Alexei Kitaev, Samuel Lomonaco, Keiji Matsumoto, Michele Mosca, Michael Nielsen, Sandu Popescu, John Preskill, Ran Raz, Oded Regev, Mary Beth Ruskai, Miklos Santha, Rudiger Schack, Guifre Vidal, John Watrous, and Andreas Winter. There will be a Rump session of short talks on recent results; please email qip@msri.org if you wish to speak during this session. There will be an experimental Interactive Web Support for QIP. For details follow this link. http://www.msri.org/ext/InteractiveWebSupportForQIP.htm
| 09:00–09:15 | Welcome and Introduction Loa Nowina-Sapinski |
| 09:15–10:00 | Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem Sean Hallgren slides (PDF) · video · video |
| 10:00–10:30 | Morning Tea |
| 10:30–11:15 | Hidden translation and orbit coset in quantum computing Miklos Santha slides (PDF) · video · video |
| 11:15–12:00 | On the dihedral hidden subgroup problem Oded Regev slides (PDF) · video · video |
| 12:00–14:00 | Lunch |
| 14:00–14:45 | Unknown quantum operations: A de Finetti representation theorem Ruediger Schack slides (PDF) · video · video |
| 14:45–15:30 | Universal source coding, soft tomography, and universal concentration Keiji Matsumoto slides (PDF) · video · video |
| 15:30–16:00 | Afternoon Tea |
| 16:00–16:45 | Majorization and quantum information Michael Nielsen video · video |
| 16:45–17:45 | Reception |
| 09:15–10:00 | Speedup by quantum walk Edward Farhi slides (PDF) · video · video |
| 10:00–10:30 | Morning Tea |
| 10:30–11:15 | Adiabatic quantum computation: Universality and tools Dorit Aharonov slides (PDF) · video · video |
| 11:15–12:00 | On the quantum derandomization of algorithms Michele Mosca slides (PDF) · video · video |
| 12:00–14:00 | Lunch |
| 14:00–14:45 | Capturing quantum complexity classes via quantum channels John Watrous slides (PDF) · video · video |
| 14:45–15:30 | A length n QECC probabilistically correcting (n-1)/2 arbitrary errors Claude Crépeau slides (PDF) · video · video |
| 15:30–16:00 | Afternoon Tea |
| 16:00–16:45 | Non-Abelian stabilizer codes for quantum error correction Mary Beth Ruskai slides (PDF) · video · video |
| 09:15–10:00 | and Samuel Lomonaco: Quantum entanglement Louis Kauffman slides (PDF) · video · video |
| 10:00–10:30 | Morning Tea |
| 10:30–11:15 | Qualifying entanglement with knot theory Willem van Dam slides (PDF) · video · video |
| 11:15–12:00 | Classical complexity and quantum entanglement of bipartite mixed states Leonid Gurvits slides (PDF) · video · video |
| 12:00–14:00 | Lunch |
| 14:00–14:45 | Quantum computation without entanglement Gilles Brassard video · video |
| 14:45–15:30 | Remote preparation of quantum states Andreas Winter slides (PDF) · video · video |
| 15:30–16:00 | Afternoon Tea |
| 16:00–16:45 | Entanglement in quantum critical phenomena Guifre Vidal slides (PDF) · video · video |
| 09:15–10:00 | Secure quantum key distribution with an uncharacterized source John Preskill slides (PDF) · video · video |
| 10:00–10:30 | Morning Tea |
| 10:30–11:15 | Composing quantum protocols Dominic Mayers slides (PDF) · video · video |
| 11:15–12:00 | TBA Sandu Popescu video |
| 12:00–14:00 | Lunch |
| 14:00–15:15 | Rump Session Umesh Vazirani |
| 15:15–15:45 | Afternoon Tea |
| 15:45–17:00 | Rump Session (continued) Umesh Vazirani |
| 09:15–10:00 | Quantum coin-flipping Alexei Kitaev slides (PDF) · video · video |
| 10:00–10:30 | Morning Tea |
| 10:30–11:15 | Simple security proof for quantum key distribution Michael Ben-Or slides (PDF) · video |
| 11:15–12:00 | Quantum computing, locally decodable codes, and private information retrieval Ronald de Wolf slides (PDF) · video |
| 12:00–14:00 | Lunch |
| 14:00–14:45 | TBA Rahul Jain |
| 14:45–15:30 | Hiding quantum data Patrick Hayden slides (PDF) · video |
| 15:30–16:00 | Afternoon Tea |
| 16:00–16:45 | Towards a quantum reverse Shannon theorem Charles Bennett slides (PDF) · video |
| 08:00–17:00 | Multi-party entanglement Sandu Popescu slides (PDF) · video |
| 08:00–17:00 | Controlling discrete quantum walks video |
| 08:00–17:00 | Searching a cube video |
| 08:00–17:00 | Non-abelian hidden subgroup problem video |
| 08:00–17:00 | Upper bound by Kolmogorov complexity for the probability in computable POVM measurement video |
| 08:00–17:00 | Quantum and relativistic bit commitment video |
| 08:00–17:00 | The capacity of hybrid quantum memory video |
| 08:00–17:00 | Robustness of gates video |
| 08:00–17:00 | An operational measure of multiple-qubit entanglement based on Grover's algorithm video |
| 08:00–17:00 | Qualitative and quantitative description of quantum entanglement video |
| 08:00–17:00 | The communication cost of simulating quantum correlations video |