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:CCIMI Seminars
SUMMARY:New Directions in Quantum Algorithms: Thermalizati
on meets Convex Optimization - Fernando Brandao\,
Caltech
DTSTART;TZID=Europe/London:20180504T110000
DTEND;TZID=Europe/London:20180504T120000
UID:TALK105559AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/105559
DESCRIPTION:Quantum computers hold the promise of solving cert
ain problems much faster than classical devices. A
n important challenge in quantum computing is to c
ome up with more quantum algorithms offering speed
-ups. I will discuss recent results on quantum alg
orithms for semidefinite programming\, an importan
t class of convex optimization problems with wides
pread applications (from resource allocation to ap
proximating hard combinatorial problems). I will s
how how solving semidefinite programs (SDPs) is co
nnected to the task of quantum Gibbs sampling (whi
ch consists of computing properties of thermal sta
tes at finite temperature on a quantum computer).
I will then discuss results on the time of thermal
ization of many-body quantum systems and show that
they directly give quantum speed-ups for SDPs. I
will also argue that the quantum algorithm for SDP
s can be seen as a generalization of quantum annea
ling and is a good candidate for realisation on sm
all quantum computers.
LOCATION:MR2 Centre for Mathematical Sciences
CONTACT:Rachel Furner
END:VEVENT
END:VCALENDAR