A mod-p generalization of the CHSH game
Duration: 1 hour 1 min
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Shor, P (Massachusetts Institute of Technology)
Thursday 14 November 2013, 14:00-15:00 |
|---|
| Created: | 2013-11-15 12:23 |
|---|---|
| Collection: | Mathematical Challenges in Quantum Information |
| Publisher: | Isaac Newton Institute |
| Copyright: | Shor, P |
| Language: | eng (English) |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 889.82 MB | View | Download | |
| WebM | 640x360 | 0.98 Mbits/sec | 449.54 MB | View | Download | |
| iPod Video | 480x270 | 522.79 kbits/sec | 233.57 MB | View | Download | |
| MP3 | 44100 Hz | 250.43 kbits/sec | 111.89 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||