![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Thursday 14 November 2013, 14:00-15:00
A mod-p generalization of the CHSH game
⚠️ Important: Mathematical Challenges in Quantum Information
- 👤 Speaker: Shor, P (Massachusetts Institute of Technology)
- 📅 Date & Time: Thursday 14 November 2013, 14:00 - 15:00
- 📍 Venue: Seminar Room 1, Newton Institute
Questions? Contact
Mustapha Amrani
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.