BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quantum algorithms from foundations to applications - Ashley Monta
 naro\, University of Bristol
DTSTART:20190531T110000Z
DTEND:20190531T120000Z
UID:TALK124120@talks.cam.ac.uk
CONTACT:Johannes Bausch
DESCRIPTION:Quantum computers are designed to use quantum mechanics to out
 perform any standard\, “classical” computer based only on the laws of 
 classical physics. Following many years of experimental and theoretical de
 velopments\, it is anticipated that quantum computers will soon be built t
 hat cannot be simulated by today’s most powerful supercomputers. But to 
 take advantage of a quantum computer requires a quantum algorithm: and des
 igning and applying quantum algorithms requires contributions to be made a
 t all levels of the theoretical “stack”\, from underpinning mathematic
 s through to detailed running time analysis. In this talk\, I will describ
 e one example of this process. First\, an abstract quantum algorithm due t
 o Aleksandrs Belovs is used to speed up classical search algorithms based 
 on the technique known as backtracking (“trial and error”). Then this 
 quantum algorithm can be applied to fundamental constraint satisfaction pr
 oblems such as graph colouring\, sometimes achieving substantial speedups 
 over leading classical algorithms. The talk will aim to give a flavour of 
 the mathematics involved in quantum algorithm design\, rather than going i
 nto full details.
LOCATION:MR14\, Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR