A modp generalization of the CHSH game
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Mathematical Challenges in Quantum Information
We consider the following modp 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.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
