Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH
2015pp. 123–132
Citations Over TimeTop 10% of 2015 papers
Abstract
n 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.
Related Papers
- New Perspectives on Zero-Knowledge Multi-Prover Interactive Proofs(2018)
- Multi-Prover Interactive Proofs: Unsound Foundations.(2017)
- Secret-chain zero-knowledge proofs and their applications(1994)
- → Multi-prover Interactive Proofs: Unsound Foundations(2017)
- → PR-015-07605-R01 Lower-Cost Liquid Meter Prover Calibration Method(2009)