Logo

Mathematical Sciences Research Institute

Home » Quantum Information Processing

Workshop

Quantum Information Processing December 13, 2002 - December 17, 2002
Registration Deadline: December 17, 2002 over 16 years ago
To apply for Funding you must register by: September 13, 2002 almost 17 years ago
Parent Program:
Organizers Steering Committee: Dorit Aharonov, Charles Bennett, Harry Buhrman, Isaac Chuang, Mike Mosca, Umesh Vazirani, and John Watrous
Speaker(s)

Show List of Speakers

Description
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
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

MSRI does not hire an outside company to make hotel reservations for our workshop participants, or share the names and email addresses of our participants with an outside party. If you are contacted by a business that claims to represent MSRI and offers to book a hotel room for you, it is likely a scam. Please do not accept their services.

MSRI has preferred rates at the Hotel Shattuck Plaza, depending on room availability. Guests can call the hotel's main line at 510-845-7300 and ask for the MSRI- Mathematical Science Research Institute discount. To book online visit this page (the MSRI rate will automatically be applied).

MSRI has preferred rates at the Graduate Berkeley, depending on room availability. Reservations may be made by calling 510-845-8981. When making reservations, guests must request the MSRI preferred rate. Enter in the Promo Code MSRI123 (this code is not case sensitive).

MSRI has preferred rates at the Berkeley Lab Guest House, depending on room availability. Reservations may be made by calling 510-495-8000 or directly on their website. Select "Affiliated with the Space Sciences Lab, Lawrence Hall of Science or MSRI." When prompted for your UC Contact/Host, please list Chris Marshall (coord@msri.org).

MSRI has a preferred rates at Easton Hall and Gibbs Hall, depending on room availability. Guests can call the Reservations line at 510-204-0732 and ask for the MSRI- Mathematical Science Research Inst. rate. To book online visit this page, select "Request a Reservation" choose the dates you would like to stay and enter the code MSRI (this code is not case sensitive).

Additional lodging options may be found on our short term housing page.

Show Directions to Venue

Show Visa/Immigration

Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Dec 13, 2002
Friday
08:00 AM - 05:00 PM
  Multi-party entanglement
Sandu Popescu
08:00 AM - 05:00 PM
  Controlling discrete quantum walks
Viv Kendon
08:00 AM - 05:00 PM
  Searching a cube
Scott Aaronson
08:00 AM - 05:00 PM
  Non-abelian hidden subgroup problem
Dmitry Gavinsky
08:00 AM - 05:00 PM
  Upper bound by Kolmogorov complexity for the probability in computable POVM measurement
Koharo Tadaki
08:00 AM - 05:00 PM
  Quantum and relativistic bit commitment
Adrian Kent
08:00 AM - 05:00 PM
  The capacity of hybrid quantum memory
Greg Kuperberg
08:00 AM - 05:00 PM
  Robustness of gates
Aram Harrow
08:00 AM - 05:00 PM
  An operational measure of multiple-qubit entanglement based on Grover's algorithm
Ofer Biham
08:00 AM - 05:00 PM
  Qualitative and quantitative description of quantum entanglement
Shengjun Wu
08:00 AM - 05:00 PM
  The communication cost of simulating quantum correlations
Ben Toner
09:00 AM - 09:15 AM
  Welcome and Introduction
Loa Nowina-Sapinski
09:15 AM - 10:00 AM
  Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Sean Hallgren
10:00 AM - 10:30 AM
  Morning Tea
10:30 AM - 11:15 AM
  Hidden translation and orbit coset in quantum computing
Miklos Santha
11:15 AM - 12:00 PM
  On the dihedral hidden subgroup problem
Oded Regev (New York University, Courant Institute)
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 02:45 PM
  Unknown quantum operations: A de Finetti representation theorem
Ruediger Schack
02:45 PM - 03:30 PM
  Universal source coding, soft tomography, and universal concentration
Keiji Matsumoto
03:30 PM - 04:00 PM
  Afternoon Tea
04:00 PM - 04:45 PM
  Majorization and quantum information
Michael Nielsen
04:45 PM - 05:45 PM
  Reception
Dec 14, 2002
Saturday
09:15 AM - 10:00 AM
  Speedup by quantum walk
Edward Farhi
10:00 AM - 10:30 AM
  Morning Tea
10:30 AM - 11:15 AM
  Adiabatic quantum computation: Universality and tools
Dorit Aharonov (The Hebrew University of Jerusalem)
11:15 AM - 12:00 PM
  On the quantum derandomization of algorithms
Michele Mosca
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 02:45 PM
  Capturing quantum complexity classes via quantum channels
John Watrous (University of Waterloo)
02:45 PM - 03:30 PM
  A length n QECC probabilistically correcting (n-1)/2 arbitrary errors
Claude Crépeau
03:30 PM - 04:00 PM
  Afternoon Tea
04:00 PM - 04:45 PM
  Non-Abelian stabilizer codes for quantum error correction
Mary Beth Ruskai (Tufts University)
Dec 15, 2002
Sunday
09:15 AM - 10:00 AM
  and Samuel Lomonaco: Quantum entanglement
Louis Kauffman (University of Illinois at Chicago)
10:00 AM - 10:30 AM
  Morning Tea
10:30 AM - 11:15 AM
  Qualifying entanglement with knot theory
Willem van Dam
11:15 AM - 12:00 PM
  Classical complexity and quantum entanglement of bipartite mixed states
Leonid Gurvits
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 02:45 PM
  Quantum computation without entanglement
Gilles Brassard
02:45 PM - 03:30 PM
  Remote preparation of quantum states
Andreas Winter
03:30 PM - 04:00 PM
  Afternoon Tea
04:00 PM - 04:45 PM
  Entanglement in quantum critical phenomena
Guifre Vidal
Dec 16, 2002
Monday
09:15 AM - 10:00 AM
  Secure quantum key distribution with an uncharacterized source
John Preskill
10:00 AM - 10:30 AM
  Morning Tea
10:30 AM - 11:15 AM
  Composing quantum protocols
Dominic Mayers
11:15 AM - 12:00 PM
  TBA
Sandu Popescu
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:15 PM
  Rump Session
Umesh Vazirani (University of California, Berkeley)
03:15 PM - 03:45 PM
  Afternoon Tea
03:45 PM - 05:00 PM
  Rump Session (continued)
Umesh Vazirani (University of California, Berkeley)
Dec 17, 2002
Tuesday
09:15 AM - 10:00 AM
  Quantum coin-flipping
Alexei Kitaev (Kavli Institute for Theoretical Physics)
10:00 AM - 10:30 AM
  Morning Tea
10:30 AM - 11:15 AM
  Simple security proof for quantum key distribution
Michael Ben-Or
11:15 AM - 12:00 PM
  Quantum computing, locally decodable codes, and private information retrieval
Ronald de Wolf
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 02:45 PM
  TBA
Rahul Jain
02:45 PM - 03:30 PM
  Hiding quantum data
Patrick Hayden
03:30 PM - 04:00 PM
  Afternoon Tea
04:00 PM - 04:45 PM
  Towards a quantum reverse Shannon theorem
Charles Bennett (IBM Thomas J. Watson Research Center)