BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lecture 2: Entanglement in quantum interactive proofs (tutorial) -
  Vidick\, T (Massachusetts Institute of Technology)
DTSTART:20130903T080000Z
DTEND:20130903T090000Z
UID:TALK46918@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In the first lecture I will present the reasonably well-unders
 tood topic of entanglement in XOR games. We will review results by Tsirels
 on and Slofstra which provide lower and upper bounds on the dimension of e
 ntanglement required to play (near-)optimally. These results are obtained 
 through connections with semidefinite programming and the theory of C*-alg
 ebras. \n\nIn the second lecture I will move to more general classes of ga
 mes. I will introduce an interesting "universal" class of entangled states
 \, embezzlement states\, and discuss some of their properties. I will pres
 ent some lower bounds on entanglement dimension\, leaving the proof of upp
 er bounds as an exercise to the audience. Time permitting I will connect t
 hese results to the complexity theory of multi-prover interactive proofs. 
 \n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR