Related papers: A multi-player, multi-team nonlocal game for the t…
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…
We will discuss the generalization of entropic uncertainty principles in terms of a game. The game involves k-players, each measuring one of k possible observables. The question is, what is the maximum number of players that can play such…
In this paper, we generalize to three players the well-known CHSH quantum game. To do so, we consider all possible 3 variables Boolean functions and search among them which ones correspond to a game scenario with a quantum advantage (for a…
We study a generalization of nonlocal games---which we call extended nonlocal games---in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob…
I give an analysis of the simplest non-commutative quantum game, which is a gambling game much like Heads or Tails. The quantum gamespace displays strategies which are not interpretable through direct-product strategies of the two players.…
We study a general $2 \times 2$ symmetric, entangled, quantum game. When one player has access only to classical strategies while the other can use the full range of quantum strategies, there are ``miracle'' moves available to the quantum…
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…
A quantum many-body state built on a classical 1D Ising model with locally entangled qubits is considered. This setup can model an infinite-player quantum Prisoner's dilemma game with each site representing two entangled players (or…
In this paper, the CHSH quantum game is extended to four players. This is achieved by exploring all possible 4-variable Boolean functions to identify those that yield a game scenario with a quantum advantage using a specific entangled…
Multipartite information principles are needed to understand nonlocal quantum correlations. Towards that end, we provide optimal bounds on genuine multipartite nonlocality for classes of THRESHOLD games using the LOCCG (Local Operations…
Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity…
Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…
The paper discusses coordination games with remote players that have access to an entangled quantum state. It shows that the entangled state cannot be used by players for communicating information, but that in certain games it can be used…
Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. These games are well suited for noisy quantum computers because they only require the preparation of a shallow circuit, followed by the…
As early as 1935, Schr\"odinger recognized entanglement as ``not one but rather the characteristic trait of quantum mechanics, the one that enforces its entire departure from classical lines of thought''. Indeed, most remarkable phenomena…
Remote entanglement enables coordinated decision making without communication and produces correlations beyond those achievable by any classical strategy, representing a practical quantum advantage in time-critical distributed…
We use the standard three-party Einstein-Podolsky-Rosen (EPR) setting in order to play general three-player non-cooperative symmetric games. We analyze how the peculiar non-factorizable joint probabilities that may emerge in the EPR setting…
Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability…
We generalize Banica's construction of the quantum isometry group of a metric space to the class of quantum metric spaces in the sense of Kuperberg and Weaver. We also introduce quantum isometries between two quantum metric spaces, and we…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…