Related papers: Quantum Advantages in Hypercube Game
The centipede game is a two-player non-zero-sum game. Each turn, a player can choose whether they want to take or pass a growing reward. The classical, rational solution of this game shows defection in the first round, when in reality,…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
Games involving quantum strategies often yield higher payoff. Here, we study a practical realization of the three-player dilemma game using the superconductivity-based quantum processors provided by IBM Q Experience. We analyze the…
We present a multipartite nonlocal game in which each player must guess the input received by his neighbour. We show that quantum correlations do not perform better than classical ones at this game, for any prior distribution of the inputs.…
We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one…
We investigate quantum strategy in moving frames by considering Prisoner's Dilemma and propose four thresholds of $\gamma$ for two players to determine their \textit{Nash Equilibria}. Specially, an interesting phenomenon appears in…
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing…
We investigate the consequences of allowing players to adopt strategies which take advantage of quantum randomization devices. In games of full information, the resulting equilibria are always correlated equilibria, but not all correlated…
We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial…
We study a generalization of the Mermin-Peres magic square game to arbitrary rectangular dimensions. After exhibiting some general properties, these rectangular games are fully characterized in terms of their optimal win probabilities for…
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n…
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…
We introduce a simple single-system game inspired by the Clauser-Horne-Shimony-Holt (CHSH) game. For qubit systems subjected to unitary gates and projective measurements, we prove that any strategy in our game can be mapped to a strategy in…
We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the…
There are increasingly suggestions for computer simulations of quantum statistics which try to violate Bell type inequalities via classical, common cause correlations. The Clauser-Horne-Shimony-Holt (CHSH) inequality is very robust.…
Application of CHSH game in Linear Cryptanalysis is presented. Till date, the known usage of CHSH game in Quantum Cryptology is to verify the device independence of the protocols. We observed that the classical symmetric ciphers having the…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some…