Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conditions that Enable a Player to Surely Win in Sequential Quantum Games

Theodore Andronikos

Published Apr 12, 2021• 1 citation
Publisher

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, which, to the best of our knowledge, are stated in this generality for the first time in the literature. The main conclusion of this paper is that the specific rules of a game are absolutely critical. The slightest variation may have important impact on the outcome of the game. It is the combination of two factors that determine 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 the advantage of either player can be established. Alternatively, the fairness of the game can also be guaranteed.

DOI
10.20944/preprints202104.0298.v1

Related papers

Quantum blackjack: Advantages offered by quantum strategies in communication-limited games

Joseph X. Lin, Joseph A. Formaggio, Aram W. Harrow +1 more

We examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the player who moves first to the player who moves second. Within this setting, we explore the usage of quantum entanglement between the players and find analytic and numerical conditions for quantum advantage over classical strategies. Using these conditions, we study a family of blackjack-type games with varying numbers of card types, and find a range of parameters where quantum advantage is achieved.

arXiv:1908.09417•Physical Review A•Jul 28, 2020•7 citations

Study of quantum games

Ahmad Razavi

Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.\nIn a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.\nIn an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.\nOther types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.

•Jan 1, 2015•0 citations

Quantum Game—Research on “PQ” Problem

Wei LI, Xiaoken Yang, Yong-Chang Huang

This paper reviews the coin flipping problem of PQ in a classical two-player game, and shows that when one player adopts quantum strategy, he can beat his classical opponent and gain higher returns. By means of quantitative means, the whole PQ problem is put in a more general and fair condition, and it is generalized and studied again from many aspects and angles. Finally, we get some more essential and important conclusions, and through some examples to explain the conclusions and its practical significances. At the same time, this paper gives the definitions of imperfect fair games and perfect fair games, revises the quantum coin flipping game to make the game fair, and studies a multi-round version of quantum coin flipping. Some basic conclusions of fair quantum game are obtained, and the meaning of perfectly fair game is explained in practice.

Acta Physica Sinica•Jan 1, 2023•0 citations

Quantum game— “PQ” problem

Xiao-Kun Yang, Wei Li, Yong-Chang Huang

This paper reviews the coin flipping problem of “PQ” in a classical two-player game, and shows that when one player adopts quantum strategy, he can beat his classical opponent and gain higher returns. By using quantitative means, the whole “PQ” problem is put under a more general and fair condition, and it is generalized and studied again from many aspects and angles. Finally, we obtain some more essential and important conclusions, and explain the conclusions and its practical significance through some practical examples. At the same time, this paper gives the definition of imperfect fair game and the definition of perfect fair game, revises the quantum coin flipping game to make the game fair, and studies a multi-round version of quantum coin flipping. Some basic conclusions of fair quantum game are obtained, and the meaning of perfectly fair game is explained in practice.

Acta Physica Sinica•Dec 26, 2023•0 citations

Some Topics in Quantum Games

Y. Avishai

This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.

arXiv:1306.0284•Jun 3, 2013•8 citations

Do classical (or quantum) transitive preferences always result in indifferent divisions

Marcin Makowski, Edward W. Piotrowski, Jan Sładkowski

The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered paradoxical and undesirable. This problem is discussed by many social and natural sciences. The paper discusses a simple model of sequential game in which two players in each iteration of the game choose one of the two elements. They make their decisions in different contexts defined by the rules of the game. It appears that the optimal strategy of one of the players can only be intransitive! (the so-called \textsl{relevant intransitive strategies}.) On the other hand, the optimal strategy for the second player can be either transitive or intransitive. A quantum model of the game using pure one-qubit strategies is considered. In this model, an increase in importance of intransitive strategies is observed -- there is a certain course of the game where intransitive strategies are the only optimal strategies for both players. The study of decision-making models using quantum information theory tools may shed some new light on the understanding of mechanisms that drive the formation of types of preferences.

arXiv:1501.04063•Dec 30, 2014•0 citations
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, which, to the best of our knowledge, are stated in this generality for the first time in the literature. The main conclusion of this paper is that the specific rules of a game are absolutely critical. The slightest variation may have important impact on the outcome of the game. It is the combination of two factors that determine 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 the advantage of either player can be established. Alternatively, the fairness of the game can also be guaranteed.
We examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the player who moves first to the player who moves second. Within this setting, we explore the usage of quantum entanglement between the players and find analytic and numerical conditions for quantum advantage over classical strategies. Using these conditions, we study a family of blackjack-type games with varying numbers of card types, and find a range of parameters where quantum advantage is achieved.
Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.\nIn a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.\nIn an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.\nOther types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.
This paper reviews the coin flipping problem of PQ in a classical two-player game, and shows that when one player adopts quantum strategy, he can beat his classical opponent and gain higher returns. By means of quantitative means, the whole PQ problem is put in a more general and fair condition, and it is generalized and studied again from many aspects and angles. Finally, we get some more essential and important conclusions, and through some examples to explain the conclusions and its practical significances. At the same time, this paper gives the definitions of imperfect fair games and perfect fair games, revises the quantum coin flipping game to make the game fair, and studies a multi-round version of quantum coin flipping. Some basic conclusions of fair quantum game are obtained, and the meaning of perfectly fair game is explained in practice.
This paper reviews the coin flipping problem of “PQ” in a classical two-player game, and shows that when one player adopts quantum strategy, he can beat his classical opponent and gain higher returns. By using quantitative means, the whole “PQ” problem is put under a more general and fair condition, and it is generalized and studied again from many aspects and angles. Finally, we obtain some more essential and important conclusions, and explain the conclusions and its practical significance through some practical examples. At the same time, this paper gives the definition of imperfect fair game and the definition of perfect fair game, revises the quantum coin flipping game to make the game fair, and studies a multi-round version of quantum coin flipping. Some basic conclusions of fair quantum game are obtained, and the meaning of perfectly fair game is explained in practice.
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered paradoxical and undesirable. This problem is discussed by many social and natural sciences. The paper discusses a simple model of sequential game in which two players in each iteration of the game choose one of the two elements. They make their decisions in different contexts defined by the rules of the game. It appears that the optimal strategy of one of the players can only be intransitive! (the so-called \textsl{relevant intransitive strategies}.) On the other hand, the optimal strategy for the second player can be either transitive or intransitive. A quantum model of the game using pure one-qubit strategies is considered. In this model, an increase in importance of intransitive strategies is observed -- there is a certain course of the game where intransitive strategies are the only optimal strategies for both players. The study of decision-making models using quantum information theory tools may shed some new light on the understanding of mechanisms that drive the formation of types of preferences.