BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An optimal adiabatic quantum query algorithm - Mathieu Brandeho (U
 niversité Libre de Bruxelles)
DTSTART:20141016T131500Z
DTEND:20141016T141500Z
UID:TALK54907@talks.cam.ac.uk
CONTACT:William Matthews
DESCRIPTION:Quantum query complexity is known to be characterized by the s
 o-called quantum adversary bound. While this result has been proved in the
  standard discrete time model of quantum computation\, it also holds for c
 ontinuous-time (or Hamiltonian based) quantum computation\, due to a known
  equivalence between these two query complexity models. In this work\, we 
 revisit this result by providing a direct proof in the continuous-time mod
 el. One originality of our proof is that it draws new connections between 
 the adversary bound\, a modern theoretical computer science technique\, an
 d early theorems of quantum mechanics. Indeed\, the proof of the lower bou
 nd is based on Ehrenfest’s theorem\, while the upper bound relies on the
  Adiabatic theorem\, as it goes by constructing an optimal adiabatic quant
 um query algorithm.
LOCATION:MR3\,  Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR