14 – 16 April 2016

Continuing the popular series of Heilbronn quantum algorithm meetings, the meeting showcases recent highlights in the field. We have three days of outstanding speakers invited from around the world to talk about their recent work. As in previous meetings, we expect the discussions to be lively and informative!

Speakers:

Andris Ambainis (University of Latvia)
Quantum algorithm for estimating the size of a search tree, with applications to backtracking and two player games

Laszlo Babai (Chicago)
Graph isomorphism in (classical) quasipolynomial time

Alexander Belov (CWI, Amsterdam)
Recent Progress in Monotonicity Testing

Anne Broadbent (Ottawa)
How to verify a quantum computation

Shalev Ben David (MIT)
Separations in query complexity using cheat sheets

Harry Buhrman (CWI, Amsterdam)
Quantum Communication Complexity

Levon Chakhmakhchyan (Université libre de Bruxelles)
A Classical algorithm inspired by the boson sampling model

Bill Fefferman (University of Maryland/NIST)
The Power of Quantum Fourier Sampling

Alex Grilo (Université Paris-Diderot)
Pointer Quantum PCPs and Multi-Prover Games

Robin Kothari (MIT)
Quantum linear systems algorithm with exponentially improved dependence on precision

Sophie Laplante (Université Paris-Diderot)
Bell inequality violations from communication complexity lower bounds

Laura Mančinska (Bristol)
Complexity classification of two-qubit commuting Hamiltonians

Maris Ozols (Cambridge)
State complexity of quantum tasks

Miklos Santha (CNRS, Paris)
On the PPA-completeness of the Combinatorial Nullstellensatz

Ronald de Wolf (CWI, Amsterdam)
Quantum algorithms in expectation

One of the highlights of the meeting will be Laszlo Babai’s talk on “Graph isomorphism in (classical) quasipolynomial time”. This talk is intended primarily for the participants of the “Quantum Algorithms” meeting. Lectures about the same topic for a general mathematical audience will be given on Tuesday and Wednesday, April 12 and 13, 14:30 – 16:00 each day, in MR2 and MR14, respectively.

A detailed programme including abstracts is available here.

There is no conference fee but we do ask that people register so we can provide catering for everyone. Please follow the link to our registration form.

The talks will be in MR2, Centre for Mathematical Sciences, Wilberforce Road, Cambridge. A list of some near-by accommodation options is available here.

We are also able to offer travel support to UK based PhD students who are unable to find funding from their home institutions (Please email Steve Brierley at steve.brierley@damtp.cam.ac.uk if you wish to apply for travel support).

We are grateful to the Heilbronn Institute and QALGO network for sponsoring the meeting