Quantum Chinos Game: winning strategies through quantum fluctuations

Abstract

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 quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.

REVTEX4.b4 file, 3 tables

References in corpus (3)

• Information and Computation: Classical and Quantum Aspects
• Quantum Cooperative Games
• Entanglement and Dynamic Stability of Nash Equilibria in a Symmetric Quantum Game

Cited by in corpus (8)

• The Application of Asymmetric Entangled States in Quantum Game
• Strategic Insights From Playing the Quantum Tic-Tac-Toe
• General quantum two-players games, their gate operators and Nash equilibria
• Quantum entanglement, indistinguishability, and the absent-minded driver's problem
• Photonic implementation of the quantum Morra game
• Simulating violation of causality using a topological phase transition
• General quantum Chinos games
• Supersymmetry and quantum games