Conditions that enable a player to surely win in sequential quantum games

Abstract

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 this class of games. The main conclusion of this paper is that the specific rules of a game are absolutely critical. The slightest variation in the rules may have important impact on the outcome of the game. This work demonstrates that it is the combination of two factors that determines who wins: (i) the sets of admissible moves for each player, and (ii) the order of moves, i.e., whether the same player makes the first and the last move. Quantum strategies do not a priori prevail over classical strategies. By carefully designing the rules of the game it is equally feasible either to guarantee the fairness of the game, or to give the advantage to either player.

14 pages, 4 figures

References in corpus (5)

• Quantum cryptography: Public key distribution and coin tossing
• Evolutionary dynamics of group interactions on structured populations: A review
• Social diversity and promotion of cooperation in the spatial prisoner's dilemma game
• Making new connections towards cooperation in the prisoner's dilemma game
• QKD based on symmetric entangled Bernstein-Vazirani

Cited by in corpus (11)

• A symmetric extensible protocol for quantum secret sharing
• A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
• Quantum secret aggregation utilizing a network of agents
• A Multiparty Quantum Private Equality Comparison scheme relying on $|GH{Z}_3⟩$ states
• An entanglement-based protocol for simultaneous reciprocal information exchange between 2 players
• One-to-Many Simultaneous Secure Quantum Information Transmission
• A Quantum Approach to News Verification from the Perspective of a News Aggregator
• A Quantum Algorithm for the Classification of Patterns of Boolean Functions
• A distributed and parallel $(k,n)$ QSS scheme with verification capability
• A novel $2$ \& $3$ player scheme for Quantum Direct Communication
• Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou