skip to content
 

A mod-p generalization of the CHSH game

Presented by: 
P Shor Massachusetts Institute of Technology
Date: 
Thursday 14th November 2013 - 14:00 to 15:00
Venue: 
INI Seminar Room 1
Abstract: 
We consider the following mod-p generalization of the CHSH game. Alice and Bob are each given a number, a and b, mod p. Alice must output x and Bob y so that x+y = ab mod p. We give some new bounds on the probability that Alice and Bob can win in both the classical and quantum games. This is joint work with Mohammad Bavarian.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons