BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A mod-p generalization of the CHSH game - Shor\, P (Massachusetts 
 Institute of Technology)
DTSTART:20131114T140000Z
DTEND:20131114T150000Z
UID:TALK48830@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We consider the following mod-p generalization of the CHSH gam
 e. \nAlice and Bob are each given a number\, a and b\, mod p. \nAlice must
  output x and Bob y so that x+y = ab mod p. \nWe give some new bounds on t
 he probability that Alice and Bob can win \nin both the classical and quan
 tum games. \n\nThis is joint work with Mohammad Bavarian.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR