Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH
Name
1311.5186.pdf
Size
1.07 MB
Format
Adobe PDF
Checksum (MD5)
e3b5e21eec7e24ceb19fc3b0a8c9ed94
Author(s)
Shor, Peter W.
Bavarian, Mohammad
Shor, Peter Williston
Date Issued
January 2015
Journal
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15
Publisher
Association for Computing Machinery (ACM)
Citation
Bavarian, Mohammad, and Peter W. Shor. “Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH.” Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS ’15 (2015).
Version
Original manuscript
Abstract
In this paper, we consider the following family of two prover one-round games. In the CHSH q game, two parties are given x; y F q uniformly at random, and each must produce an output a; b F q without communicating with the other. The players' objective is to maximize the probability that their outputs satisfy a + b = xy in F q . This game was introduced by Buhrman and Massar [7] as a large alphabet generalization of the CHSH game-which is one of the most well-studied two-prover games in quantum information theory, and which has a large number of applications to quantum cryptography and quantum complexity. Our main contributions in this paper are the first asymptotic and explicit bounds on the entangled and classical values of CHSH q , and the realization of a rather surprising connection between CHSH q and geometric incidence theory.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2688073.2688112
