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:wm266's list
SUMMARY:The complexity of antiferromagnetic 2-qubit intera
ctions and 2D lattices - Stephen Piddock (Universi
ty of Bristol)
DTSTART;TZID=Europe/London:20151008T141500
DTEND;TZID=Europe/London:20151008T151500
UID:TALK61235AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/61235
DESCRIPTION:Estimation of the minimum eigenvalue of a quantum
Hamiltonian can be formalised as the Local Hamilto
nian problem. In one natural special case of the L
ocal Hamiltonian problem\, the same 2-local intera
ction\, with differing weights\, is applied across
each pair of qubits. I will talk about some recen
t work classifying the computational complexity of
this problem when some additional physically moti
vated restrictions are made to these weights. In p
articular we consider the case where these weights
are all positive and/or that the interactions are
restricted to the edges of a 2D square (or triang
ular) lattice. For most interactions we are able t
o classify the complexity as either QMA-complete o
r contained in StoqMA.
LOCATION:MR4\, Centre for Mathematical Sciences\, Wilberfor
ce Road\, Cambridge
CONTACT:William Matthews
END:VEVENT
END:VCALENDAR