Related papers: Playing Games with Quantum Mechanics

Quantum mechanics dramatically differs from classical physics, allowing for a wide range of genuinely quantum phenomena. The goal of quantum information is to understand information processing from a quantum perspective. In this mindset, it…

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In…

We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict…

This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. The quantization process involves extending the classical game by introducing two additional unitary strategies. We consider five…

We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…

We introduce a game to illustrate the principles of quantum mechanics using a qubit (or spin-first) approach, where students can experience and discover its puzzling features first-hand. Students take the role of particles and scientists.…

Categorical quantum mechanics, which examines quantum theory via dagger-compact closed categories, gives satisfying high-level explanations to the quantum information procedures such as Bell-type entanglement or complementary observables…

A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix give the payoff of players.…

We study possible influence of not necessarily sincere arbiter on the course of classical and quantum 2x2 games and we show that this influence in the quantum case is much bigger than in the classical case. Extreme sensitivity of quantum…

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…

We review both theoretical and experimental developments in the area of quantum games since the inception of the subject circa 1999. We will also offer a narrative on the controversy that surrounded the subject in its early days, and how…

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 define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…

In the context of quantum information theory, "quantization" of various mathematical and computational constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of…

The concept of forming harmonious coalitions is introduced to both classical and quantum symmetric cooperative game. In both cases, players are motivated to form coalitions. Also, the main feature of the cooperative game is conserved.

We investigate quantitative extensions of modal logic and the modal mu-calculus, and study the question whether the tight connection between logic and games can be lifted from the qualitative logics to their quantitative counterparts. It…

Communication games are collaborative information processing tasks involving a number of players with limited communication. Such games are useful tools for studying physical theories. A physical theory exhibits preparation contextuality…

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…

Today, people are looking forward to get an awesome computational power. This kind of desire can be answered by quantum computing. By adopting quantum mechanics theory, it can generate a very fast computation result. As known, quantum…

The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of "quantum advantages" in various information processing tasks. Problems such as when quantum…