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:Isaac Newton Institute Seminar Series
SUMMARY:A polynomial-time algorithm for the ground state o
f 1D gapped local Hamiltonians - Vidick\, T (Massa
chusetts Institute of Technology)
DTSTART;TZID=Europe/London:20131128T150000
DTEND;TZID=Europe/London:20131128T160000
UID:TALK49083AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/49083
DESCRIPTION:Co-authors: Zeph Landau (UC Berkeley)\, Umesh Vazi
rani (UC Berkeley) \n\nComputing ground states of
local Hamiltonians is a fundamental problem in con
densed matter physics. We give the first randomize
d polynomial-time algorithm for finding ground sta
tes of gapped one-dimensional Hamiltonians: it out
puts an (inverse-polynomial) approximation\, expre
ssed as a matrix product state (MPS) of polynomial
bond dimension. The algorithm combines many ingre
dients\, including recently discovered structural
features of gapped 1D systems\, convex programming
\, insights from classical algorithms for 1D satis
fiability\, and new techniques for manipulating an
d bounding the complexity of MPS. Our result provi
des one of the first major classes of Hamiltonians
for which computing ground states is provably tra
ctable despite the exponential nature of the objec
ts involved. \n\nJoint work with Zeph Landau and U
mesh Vazirani.\n\n\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR