The Twelfth Workshop on Quantum Information Processing
QIP 2009 — January 12–16, 2009 · Santa Fe Convention Center, Santa Fe, New Mexico, USA
About the Workshop
QIP: Premier Forum for Quantum Information Theory
Fifteen years before QIP 2009, Shor's efficient quantum algorithms for factoring integers and evaluating discrete logarithms launched the field of quantum information processing into the public consciousness. QIP has since become one of the most active and fastest-growing research areas in computer science and physics, spanning topics such as quantum computation, quantum communication, and quantum cryptography.
QIP 2009 was the twelfth in a series of international workshops dedicated to disseminating recent theoretical advances in this field. Like its previous editions, QIP 2009 featured invited talks, contributed talks, and a poster session.
The workshop was hosted by the Center for Quantum Information and Control (CQuIC) at the University of New Mexico, with local organizers drawn from UNM, the Santa Fe Institute, and Los Alamos National Laboratory.
Workshop Highlights
- Matt Hastings presented two landmark results: a counterexample to the additivity conjecture and an area law proof for gapped 1D systems.
- Graeme Smith and Jon Yard demonstrated that zero-capacity quantum channels can have positive capacity when combined — a striking superactivation result.
- Andrew Childs showed that quantum walk enables universal computation.
- Scott Aaronson and John Watrous showed that closed timelike curves collapse the gap between quantum and classical computation.
- State-of-the-art audio/visual setup with digital recordings of all talks at the Santa Fe Convention Center.
Keynotes
Invited Speakers
Six distinguished researchers were invited to give plenary lectures spanning quantum computation, quantum error correction, and quantum cryptography.
Andrew Childs
IQC, University of Waterloo
Universal computation by quantum walk
Avinatan Hassidim
Hebrew University, Jerusalem
Multi-prover interactive proofs with communicating provers
Matt Hastings
Los Alamos National Laboratory
A counterexample to additivity; Area laws for quantum many-body systems
Charles Marcus
Harvard University
Holding quantum information in electron spins
Lluis Masanes
IPS, Barcelona
Device-independent security in QKD
Graeme Smith
IBM T.J. Watson Research Center
Quantum communication with zero-capacity channels
Full Program
Talks (in order of presentation)
All 41 presentations from QIP 2009, covering quantum algorithms, error correction, communication, cryptography, and complexity.
| # | Authors | Title | Type |
|---|---|---|---|
| 1 | Andrew Landahl | Opening remarks | Opening |
| 2 | Matt Hastings | A counterexample to additivity | Invited |
| 3 | Patrick Hayden and Andreas Winter | The fidelity alternative and quantum measurement simulation | Contributed |
| 4 | Sergey Bravyi and Barbara Terhal | A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes | Contributed |
| 5 | Dmitry Gavinsky | Predictive quantum learning | Contributed |
| 6 | Graeme Smith | Quantum communication with zero-capacity channels | Invited |
| 7 | John Smolin and Graeme Smith | Can non-private channels transmit quantum information? | Contributed |
| 8 | Ashley Montanaro and Tobias Osborne | Quantum Boolean functions | Contributed |
| 9 | Yi-Kai Liu | Quantum algorithms using the curvelet transform | Contributed |
| 10 | Dave Bacon, Wim van Dam and Alexander Russell | Analyzing quantum circuits using the least action principle | Contributed |
| 11 | Avinatan Hassidim | Multi-prover interactive proofs with communicating provers | Invited |
| 12 | Andris Ambainis | Quantum algorithms are at most polynomially faster than classical for any symmetric function | Contributed |
| 13 | Jean-Pierre Tillich | Quantum tornado codes | Contributed |
| 14 | Norbert Schuch and Frank Verstraete | Interacting electrons, density functional theory, and quantum Merlin-Arthur | Contributed |
| 15 | Andrew Childs | Universal computation by quantum walk | Invited |
| 16 | Dmitry Gavinsky | Classical interaction cannot replace quantum nonlocality | Contributed |
| 17 | Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando Somma and David Yonge-Mallo | Efficient discrete-time simulations of continuous-time quantum query algorithms | Contributed |
| 18 | Tsuyoshi Ito, Hirotada Kobayashi and Keiji Matsumoto | Oracularization and two-prover one-round interactive proofs against nonlocal strategies | Contributed |
| 19 | Panos Aliferis and John Preskill | Fault-tolerant quantum computing against highly biased noise | Contributed |
| 20 | Bryan Eastin and Emanuel Knill | Restrictions on transversal encoded quantum gate sets | Contributed |
| 21 | Avraham Ben-Aroya and Amnon Ta-Shma | Approximate quantum error correction for correlated noise | Contributed |
| 22 | Dmitry Maslov | Quantum information funding at the National Science Foundation | Special |
| 23 | Charles Marcus | Holding quantum information in electron spins | Invited |
| 24 | Sandy Irani | Ground states entanglement in one-dimensional translationally-invariant quantum systems | Contributed |
| 25 | Fernando Brandao and Martin Plenio | Quantum Stein's lemma for correlated states and asymptotic entanglement transformations | Contributed |
| 26 | Steve Flammia, David Gross, Jens Eisert, Michael Bremner, Andreas Winter and Caterina Mora | Most quantum states are useless for measurement-based quantum computation | Contributed |
| 27 | Matt Hastings | Area laws for quantum many-body systems: Gapped one-dimensional systems are in NP | Invited |
| 28 | Norbert Schuch, J. Ignacio Cirac and Frank Verstraete | The computational difficulty of finding MPS ground states | Contributed |
| 29 | Dan Shepherd and Michael Bremner | Instantaneous quantum computation | Contributed |
| 30 | Jens Eisert and David Gross | Lieb-Robinson bounds and "supersonic quantum communication" | Contributed |
| 31 | Scott Aaronson and John Watrous | Closed timelike curves make quantum and classical computing equivalent | Contributed |
| 32 | Lluis Masanes | Device-independent security in QKD | Invited |
| 33 | Amnon Ta-Shma | Short seed extractors against quantum storage | Contributed |
| 34 | Jop Briet, Harry Buhrman and Ben Toner | A generalized Grothendieck inequality and entanglement in XOR games | Contributed |
| 35 | Dejan Dukaric, Manuel Forster, Severin Winkler and Stefan Wolf | On non-locality distillation | Contributed |
| 36 | Gilles Brassard, Louis Salvail and Alain Tapp | Key distribution and oblivious transfer à la Merkle | Contributed |
| 37 | Robert Koenig, Renato Renner and Christian Schaffner | The operational meaning of min- and max-entropy | Contributed |
| 38 | Matthias Christandl, Dejan Dukaric, Robert Koenig and Renato Renner | Postselection-technique with applications to quantum cryptography and the parallel repetition problem | Contributed |
| 39 | Robert Koenig, Ben Reichardt and Guifre Vidal | Exact entanglement renormalization for string-net models | Contributed |
| 40 | Aram Harrow and Richard Low | Efficient quantum tensor product expanders and k-designs | Contributed |
| 41 | Bill Rosgen | Distinguishability of random unitary channels | Contributed |
Slides for individual talks were available via the official QIP 2009 website. Digital video recordings of all talks were produced at the Santa Fe Convention Center.
Where & When
Conference Venue
Santa Fe Convention Center
Main Conference Venue
- Free high-speed wireless Internet
- Brand new adobe-style 72,000 sq. ft. (6,690 m²) center
- Located in the heart of Santa Fe's downtown
- At the end of the historic Santa Fe Trail
- 26 ft (8 m) high ceilings with state-of-the-art A/V
- Digital recordings of all QIP talks produced on-site
La Fonda on the Plaza
Conference Hotel
- Free high-speed wireless Internet
- Award-winning pueblo-style Spanish architecture
- Located directly on historic Santa Fe Plaza
- 8-minute walk to the Convention Center
- Block of 160 rooms reserved for conference attendees
Conference hotel rate deadline: December 10, 2008
Santa Fe, New Mexico
Conference City
- World-class restaurants, galleries & museums
- Rich Native American and Spanish colonial history
- Outdoor activities: hiking, skiing, biking
- ~60 min from Albuquerque International Sunport (ABQ)
Organization
Committees
Program Committee
-
Hans BriegelUniversity of Innsbruck
-
Harry BuhrmanCWI, Amsterdam
-
Wim van DamUC Santa Barbara
-
Daniel GottesmanPerimeter Institute
-
Aram HarrowUniversity of Bristol
-
Patrick HaydenMcGill University
-
Richard Jozsa ChairUniversity of Bristol
-
Julia KempeTel Aviv University
-
Manny KnillNIST
-
Andrew LandahlUniversity of New Mexico
-
Debbie LeungIQC, University of Waterloo
-
Keiji MatsumotoNII Tokyo
Local Organizers
-
Howard BarnumLos Alamos National Laboratory
-
Jim HarringtonLos Alamos National Laboratory
-
Andrew Landahl ChairUniversity of New Mexico
-
Cris MooreUNM / Santa Fe Institute
-
Jon YardLos Alamos National Laboratory
Getting There
Travel Information
Santa Fe is conveniently accessible from Albuquerque International Sunport (ABQ), approximately one hour's drive away.
By Air
Fly into Albuquerque International Sunport (ABQ) — the most convenient airport. Santa Fe does not have commercial airline service.
Shuttle Service
Sandia Shuttle operates hourly service between ABQ and Santa Fe throughout most of the day. Cost: $25 one-way or $45 round trip. Reservations available online or by phone; shuttle desk located near baggage claim at ABQ.
Car Rental
Nine car rental companies are located at the Sunport Car Rental Center, accessible by a quick shuttle from outside baggage claim. Driving time to Santa Fe is approximately 60 minutes via I-25 North.
QIP Series
Previous QIP Workshops
QIP 2009 was the 12th in a series of annual workshops on quantum information processing, which began in Aarhus, Denmark in 1998.