Worst Case Analysis of Non-local Games
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input xi to the ith player who then responds by sending an answer ai to the referee. The players win if the answers ai satisfy a condition that may depend on the inputs xi.
Typically, non-local games are studied in a framework where the referee picks the inputs from a known probability distribution. We initiate the study of non-local games in a worst-case scenario when the referee’s probability distribution is unknown and study several non-local games in this scenario.
Unable to display preview. Download preview PDF.
- 3.Ambainis, A., Backurs, A., Balodis, K., Skuskovniks, A., Smotrovs, J., Virza, M.: Worst case analysis of non-local gamesGoogle Scholar
- 6.Aravind, P.K.: The magic squares and Bell’s theorem (2002) (manuscript)Google Scholar
- 7.Bennett, C.H., Brassard, G.: Quantum Cryptography: Public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, p. 175 (1984)Google Scholar
- 8.Briet, J., Vidick, T.: Explicit lower and upper bounds on the entangled value of multiplayer XOR gamesGoogle Scholar
- 9.Buhrman, H., Regev, O., Scarpa, G., de Wolf, R.: Near-Optimal and Explicit Bell Inequality Violations. In: Proceedings of CCC 2011, pp. 157–166 (2011)Google Scholar
- 12.Cleve, R., Høyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings of CCC 2004, pp. 236–249 (2004)Google Scholar
- 14.Kempe, J., Kobayashi, H., Matsumoto, K., Toner, B., Vidick, T.: Entangled Games are Hard to Approximate. In: Proceedings of FOCS 2008, pp. 447–456 (2008)Google Scholar
- 15.Merminm, D.: Extreme Quantum Entanglement in a Superposition of Macroscopically Distinct States. Physical Review Letters 65, 15 (1990)Google Scholar
- 16.Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: FOCS 1994, pp. 124–134 (1994)Google Scholar
- 18.Simon, D.R.: On the power of quantum computation. In: Proceedings of FOCS 1994, pp. 116–123. IEEE (1994)Google Scholar
- 21.Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227 (1977)Google Scholar