The Ninth Workshop on
Quantum Information Processing
Paris, January 16-20, 2006

General information | Call for communications | Practical information
List of posters | List of talks | Abstracts | Schedule | Group photo | Other photos

List of talks

There were 160 submissions

Invited talks

A new quantum lower bound method, with applications to strong direct product theorems
by Andris Ambainis (University of Waterloo), joint work with Robert Spalek, Ronald de Wolf
Quantum information with Rydberg atoms and photons in cavities: results and perspectives
by Serge Haroche (Collège de France and Ecole Normale Supérieure, Paris)
Fourier sampling, representations, and the hunt for a quantum algorithm for Graph Isomorphism
by Cris Moore (University of New Mexico), joint work with Alex Russell, Leonard Schulman
Rigorous fault-tolerance thresholds
by Ben Reichardt (University of California, Berkeley)
An exponential de Finetti theorem and its applications to quantum cryptography
by Renato Renner (CQC, Cambridge)
Cryptography in the Bounded Quantum-Storage Model
by Christian Schaffner (BRICS, University of Aarhus), joint work with Ivan B. Damgaard, Serge Fehr, Louis Salvail
Graph Isomorphism, the hidden subgroup problem and distinguishing quantum states
by Pranab Sen (NEC Labs America), joint work with Sean Hallgren, Martin Rotteler
Zero-knowledge against quantum attacks
by John Watrous (University of Calgary)

Long talks

Verifiable Quantum Secret Sharing and Secure Multi-Party Quantum Computation
by Michael Ben-Or (Hebrew University), joint work with Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith
Classical and quantum strategies for two-prover bit commitments
by Claude Crépeau (McGill University), joint work with Jean-Raymond Simard, Alain Tapp
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
by Wim van Dam (University of California, Santa Barbara), joint work with Andrew M. Childs, Dave Bacon
Bounded-Error Quantum State Identification with Applications to Communication Complexity
by Dmitry Gavinsky (University of Calgary), joint work with Julia Kempe, Oded Regev, Ronald de Wolf
Fixed-point quantum searching
by Lov Grover (Bell Labs, Lucent)
The classical and quantum private capacities of a secret shared Cartesian frame
by Patrick Hayden (McGill University), joint work with Stephen Bartlett, Robert Spekkens
Quantum Network Coding
by Kazuo Iwama (Kyoto University), joint work with Masahito Hayashi, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
A de Finetti theorem for finite quantum states - Locked correlations and secret keys
by Robert Koenig (CQC, Cambridge), joint work with Renato Renner
A classical analog of negative information
by Jonathan Oppenheim (University of Cambridge), joint work with Rob Spekkens, Andreas Winter
A fault-tolerant one-way quantum computer
by Robert Raussendorf (Caltech), joint work with Jim Harrington, Kovid Goyal
Simulating quantum computation by contracting tensor networks
by Yaoyun Shi (University of Michigan, Ann Arbor), joint work with Igor Markov
Communicating over adversarial quantum channels
by Graeme Smith (Caltech), joint work with Aram Harrow, Debbie Leung
Irreversibility for all bound entangled states
by Barbara Synak-Radtke (University of Gdansk), joint work with Dong Yang, Michal Horodecki, Ryszard Horodecki
New Limits on Fault-Tolerant Quantum Computation
by Falk Unger (CWI), joint work with Harry Buhrman, Richard Cleve, Monique Laurant, Noah Linden, Alexander Schrijver
On the complexity of simulating quantum systems
by Frank Verstraete (Caltech)
Extremality of Gaussian quantum states
by Michael Wolf (Max Planck Institut für Quantenoptik, Garching), joint work with Geza Giedke, Ignacio Cirac

Short talks

Quantum entanglement can be simulated without communication
by Nicolas Cerf (Université Libre de Bruxelles), joint work with Nicolas Gisin, Serge Massar, Sandu Popescu
Simulating quantum correlations as a distributed sampling problem
by Julien Degorre (Université Paris-Sud, Orsay), joint work with Sophie Laplante, Jérémie Roland
Dualities in quantum information theory
by Igor Devetak (University of Southern California)
Quantum computation as geometry
by Andrew Doherty (University of Queensland), joint work with Michael Nielsen, Mark Dowling, Mile Gu
From Bell's Theorem to Secure Quantum Key Distribution
by Nicolas Gisin (Geneva University), joint work with Antonio Acin, LLuis Masanes
Asymmetric unitary gate capacities
by Aram Harrow (University of Bristol), joint work with Peter Shor
Quantum Search in an Ordered List via Adaptive Learning
by Avinatan Hassidim (The Hebrew University), joint work with Michael Ben-Or
Quantum key distribution based on arbitrarily-weak distillable entangled states
by Karol Horodecki (University of Gdansk), joint work with Debbie Leung, Hoi-Kwong Lo, Jonathan Oppenheim
Schumacher compression with minimum time-space product
by Masahiro Kitagawa (Osaka University / JST)
Quantum communication by erasure channel assisted by back classical communication
by Debbie Leung (University of Waterloo), joint work with Peter Shor
A limit on nonlocality in any world in which communication complexity is not trivial
by André Méthot (Université de Montréal), joint work with Gilles Brassard, Harry Buhrman, Noah Linden, Alain Tapp, Falk Unger
Self-Testing of Quantum Circuits
by Harold Ollivier (Perimeter Institute), joint work with Frédéric Magniez, Dominic Mayers, Michele Mosca
The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
by Tobias Osborne (Royal Holloway, University of London)
Monogamy of nonlocal quantum correlations
by Benjamin Toner (Caltech)
Entanglement in Interactive Proof Systems with Binary Answers
by Stephanie Wehner (CWI)
Lower Bounds on Matrix Rigidity via a Quantum Argument
by Ronald de Wolf (CWI)