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

Chinese Control Conference (CCC)

Does quantization always make games fairer?

Boyang Liu, Ming Zhang, Hong‐Yi Dai, Jiahua Wei

Published Jul 1, 2014• 0 citations
Publisher

Abstract

Taking Quantum Trade Game as an example, how strategy quantization will influence the fairness of games is discussed in this paper. Strategy moves will make classical games no longer fair as they break the original rules of the games. We extend classical Trade Game into quantum field. By calculating the variances in optimal strategies and results caused by performing strategy moves, its influences on classical Trade Game and quantum Trade Game are compared. In the case of Trade Game, the quantum version will suffer less from strategy moves, which reveals that the quantization of strategies can make games fairer. From the viewpoint of quantum-classical hybrid system, such a characteristic also reflects quantum system's advantage in resisting classical information interruptions.

DOI
10.1109/chicc.2014.6895953

Related papers

Quantum Strategy Without Entanglement

Jiangfeng Du, Xiaodong Xu, Hui Li +3 more

In this paper we quantize the Card Game. In the classical version of this game, one player (Alice) can always win with propability 2/3. But when the other player (Bob) is allowed to apply quantum strategy, the original unfair game turns into a fair and zero-sum game. Further more, the procedure in which Bob perform his quantum strategy does not include any ingredient of entanglement.

arXiv:quant-ph/0011078•Nov 19, 2000•20 citations

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

Theodore Andronikos

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.

•Apr 12, 2021•1 citation

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

Quantum Advantage in Trading: A Game-Theoretic Approach

Faisal Shah Khan, Norbert M. Linke, Anton T. Than +1 more

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their implementation on an ion-trap quantum computer. The results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria. This advantage could help uncover alpha in trading strategies, defined as excess returns compared to established benchmarks. These findings suggest that quantum computing could significantly influence the development of financial strategies.

arXiv:2501.17189•Quantum Economics and Finance•Apr 17, 2025•7 citations

Quantum Strategies

Gordon B. Dahl, Steven E. Landsburg

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 equilibria appear as quantum equilibria. The classical and quantum theories diverge further in games of private information. In the quantum context, we show that Kuhn's equivalence between behavioral and mixed strategies breaks down. As a result, quantum technology allows players to achieve outcomes that would not be achievable with any classical technology short of direct communication; in particular they do not occur as correlated equilibria. In general, in games of private information, quantum technology allows players to achieve outcomes that are Pareto superior to any classical correlated equilibrium, but not necessarily Pareto optimal. A simple economic example illustrates these points.

arXiv:1110.4678•Oct 21, 2011•4 citations
Taking Quantum Trade Game as an example, how strategy quantization will influence the fairness of games is discussed in this paper. Strategy moves will make classical games no longer fair as they break the original rules of the games. We extend classical Trade Game into quantum field. By calculating the variances in optimal strategies and results caused by performing strategy moves, its influences on classical Trade Game and quantum Trade Game are compared. In the case of Trade Game, the quantum version will suffer less from strategy moves, which reveals that the quantization of strategies can make games fairer. From the viewpoint of quantum-classical hybrid system, such a characteristic also reflects quantum system's advantage in resisting classical information interruptions.
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.
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.
Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their implementation on an ion-trap quantum computer. The results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria. This advantage could help uncover alpha in trading strategies, defined as excess returns compared to established benchmarks. These findings suggest that quantum computing could significantly influence the development of financial strategies.
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 equilibria appear as quantum equilibria. The classical and quantum theories diverge further in games of private information. In the quantum context, we show that Kuhn's equivalence between behavioral and mixed strategies breaks down. As a result, quantum technology allows players to achieve outcomes that would not be achievable with any classical technology short of direct communication; in particular they do not occur as correlated equilibria. In general, in games of private information, quantum technology allows players to achieve outcomes that are Pareto superior to any classical correlated equilibrium, but not necessarily Pareto optimal. A simple economic example illustrates these points.