Worst case analysis of non-local games

DOI10.1007/978-3-642-35843-2_12MaRDI QIDQ2927639zbMATH OpenOpenAlexWikidataFDO

Authors Artūrs Bačkurs, Kaspars Balodis, Agnis Škuškovniks, J. Smotrovs, Madars Virza, Andris Ambainis

Publication date 4 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.2856

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Cooperative games (91A12) Applications of game theory (91A80)

Abstract: 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 $x_i$ to the $i^{th}$ player who then responds by sending an answer $a_i$ to the referee. The players win if the answers $a_i$ satisfy a condition that may depend on the inputs $x_i$. 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.

Recommendations

• On symmetric nonlocal games
• Nonlocal Quantum XOR Games for Large Number of Players
• Two party non-local games
• Provable Advantage for Quantum Strategies in Random Symmetric XOR Games
• Quantum strategies are better than classical in almost any XOR game

Cited in

(1)

• Analysis of Boolean functions related to binary input binary output two-party nonlocal games

This page was built for publication: Worst case analysis of non-local games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927639)