BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The computational complexity of entanglement detection - Hayden\, 
 P (Standford University)
DTSTART:20131212T160000Z
DTEND:20131212T170000Z
UID:TALK49308@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In quantum information\, theorists and experimentalists alike 
 are often acutely concerned with whether a given physical system is entang
 led or not. Recently\, string theorists have acquired a similar morbid fas
 cination because of catastrophic violations of monogamy of entanglement th
 at seem to be caused by black holes. In this talk\, I will explain how var
 ious formulations of the entanglement detection problem provide natural co
 mplete problems for a host of complexity classes including NP\, BQP\, QMA\
 , QMA(2)\, QSZK and QIP. Moreover\, entanglement detection provides a natu
 ral candidate for the first nontrivial complete problem for QIP(2). In som
 e cases\, the complexity depends subtly on the distance measure used\, spe
 cifically the trace distance versus the 1-way LOCC distance. To conclude\,
  I'll sketch how the difficulty of performing entanglement detection may h
 elp string theorists to sleep better at night.\n\nThe talk will be based o
 n joint work with Gus Gutoski\, Daniel Harlow\, Kevin Milner and Mark Wild
 e in the articles 1308.5788\, 1301.4504 and 1211.6120.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR