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

TL;DR
This paper explores how the structure of sequential quantum games, especially the rules and move order, critically influences the possibility of guaranteeing a player's victory, showing that quantum strategies are not inherently superior.
Contribution
It introduces a group-theoretic framework for analyzing sequential quantum games and highlights the importance of game rules and move order in determining outcomes.
Findings
Game rules critically affect winning chances.
Quantum strategies are not always advantageous.
Proper rule design can ensure fairness or advantage.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
