2015 · 16 citations · 26 references
ComputingComputer ScienceMathematicsCryptographyGame TheoryInformation TheoryQuantum CommunicationQuantum ComputationQuantum Information TheoryCausalityInformation TransmissionQuantum ComplexityTwo-player Games
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.
26
Quantum cryptography based on Bell’s theorem
Artur Ekert · Physical Review Letters · 1991 · 10.7K citations
Computing, Physics, Cryptography +16
Proposed Experiment to Test Local Hidden-Variable Theories
John F. Clauser, Michael Horne, Abner Shimony et al. · Physical Review Letters · 1969 · 7.6K citations · Full text
Quantum generalizations of Bell's inequality
B. S. Cirel'son · Letters in Mathematical Physics · 1980 · 1.8K citations
Quantum nonlocality as an axiom
Sandu Popescu, Daniel Rohrlich · Foundations of Physics · 1994 · 1.6K citations
Information causality as a physical principle
Marcin Pawłowski, Tomasz Paterek, Dagomir Kaszlikowski et al. · Nature · 2009 · 788 citations · Full text