### A mod-p generalization of the CHSH game

Shor, P *(Massachusetts Institute of Technology)*

Thursday 14 November 2013, 14:00-15:00

Seminar Room 1, Newton Institute

#### 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.

#### Video

**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.

## Comments

Start the discussion!