The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Isaac Newton Institute for Mathematical Sciences

Complexity, Computation and the Physics of Information

May to August 1999

Organisers: A Albrecht (UC Davis), Peter Knight (Imperial), RM Solovay (Berkeley), W Zurek (LANL)

Workshop: Quantum Computation and Algorithms

Monday 19 July

09.20-09.30 R Jozsa (Plymouth)
Welcome

Session 3.1 Chair: R Jozsa

09.30-10.10 P Horodecki (Gdansk)
Controlling bound entanglement

10.10-10.50 M Nielsen (Caltech)
On the structure of the entangled states

10.50-11.30 S Popescu (Isaac Newton Institute)
Multi-particle entanglement

12.30-14.00 Lunch

15.30-16.00 Tea

Session 3.2 Chair: R Laflamme

16.00-16.40 P Vitanyi (CWI)
The quantitative definition of information in an individual pure quantum state

16.40-17.20 G Vidal (Barcelona)
Optimal local conversions of entangled pure states with finite resources

17.20-18.00 D Aharonov (Princeton)
A Phase Transition in the scale of multi-particle entanglement in noisy quantum computers

19.15 Dinner

 

Tuesday 20 July

Session 3.3 Chair: H Buhrman

09.30-10.10 U Vazirani (UC, Berkeley)
A Quantum Characterization of NP

10.10-10.50 R Cleve (Calgary)
Communication complexity with quantum information

10.50-11.30 R De Wolf (CWI)
Quantum black-box complexity: worst-case and average-case

12.00-14.00 Lunch

15.00-15.30 Tea

Session 3.4 Chair: R Cleve

15.30-16.10 G Brassard (Montreal)
Trading entanglement for communication

16.10-16.50 D Meyer (UC, San Diego)
Finite precision measurement nullifies the Kochen-Specker theorem

16.50-17.30 R Freivalds (Latvia)
Quantum finite automata

18.00-19.00 CUP Reception

19.15 Dinner

 

Wednesday 21 July

Session 3.5 Chair: M Mosca

09.30-10.10 R Solovay (UC, Berkeley)
Lie groups and quantum circuits

10.10-10.50 J Watrous (Montreal)
Quantum interactive proof systems

10.50-11.30 C Williams (Jet Propulsion Laboratory, Caltech)
Quantum computing meets Wall Street: a fast quantum algorithm for pricing derivatives

12.00-14.00 Lunch

15.00-15.30 Tea

Session 3.6 Chair: T Havel

15.30-16.10 HF Chau (Hong Kong)
Quantum codes from an algebraic geometric point of view

16.10-16.50 V Roychowdhuri (UCLA)
Cooling and algorithms for ensemble quantum computers

16.50-17.30 A Kent (Cambridge)
Classical and quantum bit commitment

17.30-19.00 Posters and Wine Reception at the Isaac Newton Institute

19.15 Dinner

 

Thursday 22 July

Session 3.7 Chair: W Wootters

09.00-09.40 I Chuang (IBM Research)
Quantum teleportation is a universal computational primitive

09.40-10.20 R Laflamme (Los Alamos)
Demonstration of quantum control using NMR

10.20-10.50 Coffee

10.50-11.30 R Schack (London)
Classical model for bulk-ensemble NMR quantum computation

11.30-12.10 T Havel (Harvard Medical School)
Geometric algebra methods in ensemble quantum computing by NMR

12.30-14.00 Lunch

15.30-16.00 Tea

Session 3.8 Chair: C Williams

16.00-16.40 E Knill (Los Alamos)
On the control of quantum noise

16.40-17.20 M Grassl (Karlsruhe)
Description of multi-particle entanglement through polynomial
invariants

17.20-18.00 D Abrams (Jet Propulsion Laboratory, Caltech)
Fast Quantum Algorithms for Integrals and Stochastic Processes

19.15 Dinner

 

Friday 23 July

Session 3.9 Chair: G Brassard

09.30-10.10 M Mosca (Oxford)
Preparing arbitrary states

10.10-10.50 M Santha (Paris Sud.)
Self-testing of one-qubit gates

10.50-11.30 M Ozawa (Nagoya)
Halting and measurement of quantum Turing machines

12.00-14.00 Lunch

15.30-16.00 Tea

Session 3.10 Chair: P Knight

16.00-16.40 L Diosi (IAS, Berlin)
On coexistence of classical continuum and quantum theory

16.40-17.20 A Ekert (Oxford)
Quantum computation = multiparticle interferometry

17.20-18.00 R Penrose (Oxford)
Quantum State Reduction as a Gravitational Phenomenon: Theory and Experiment

18.15-19.15 Buffet and Wine Reception at the Isaac Newton Institute

 

Copyright © Isaac Newton Institute