A mod-p generalization of the CHSH game
Seminar Room 1, Newton Institute
AbstractWe 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.