Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH
arXiv:1311.5186
Abstract
In this work, we consider the following family of two prover one-round games. In the CHSH_q game, two parties are given x,y in F_q uniformly at random, and each must produce an output a,b in 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 (PRA 2005) as a large alphabet generalization of the celebrated 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. On the way to these results, we also resolve a problem of Pawlowski and Winter about pairwise independent Information Causality, which, beside being interesting on its own, gives as an application a short proof of our upper bound for the entangled value of CHSH_q.
arXiv commentFixed some typos and added minor errors
References in corpus (10)
- Information Causality as a Physical Principle
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- No quantum advantage for nonlocal computation
- Large violation of Bell inequalities with low entanglement
- Reexamination of a multisetting Bell inequality for qudits
- Multi-setting Bell inequality for qudits
- Hyperbits: the information quasiparticles
- Information Equals Amortized Communication
- New quantitative estimates on the incidence geometry and growth of finite sets
- Functional boxes, communication complexity and information causality