BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CQIF Seminar
SUMMARY:An optimal adiabatic quantum query algorithm - Mat
hieu Brandeho (UniversitĂ© Libre de Bruxelles)
DTSTART;TZID=Europe/London:20141016T141500
DTEND;TZID=Europe/London:20141016T151500
UID:TALK54907AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/54907
DESCRIPTION:Quantum query complexity is known to be characteri
zed by the so-called quantum adversary bound. Whil
e this result has been proved in the standard disc
rete time model of quantum computation\, it also h
olds for continuous-time (or Hamiltonian based) qu
antum computation\, due to a known equivalence bet
ween these two query complexity models. In this wo
rk\, we revisit this result by providing a direct
proof in the continuous-time model. One originalit
y of our proof is that it draws new connections be
tween the adversary bound\, a modern theoretical c
omputer science technique\, and early theorems of
quantum mechanics. Indeed\, the proof of the lower
bound 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\, Wilberfo
rce Road\, Cambridge
CONTACT:William Matthews
END:VEVENT
END:VCALENDAR