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

arXiv:1908.09417 · Physical Review A

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

Joseph X. Lin, Joseph A. Formaggio, Aram W. Harrow, Anand Natarajan

Published Jul 28, 2020• 8 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.102.012425

Related papers

Quantum blackjack : quantum strategies and advantages in games with limited classical communication

Joseph X. Lin

In this thesis, we examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we particularly focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the first-mover to the late-mover. Within this setting, optimal usage of quantum entanglement is explored, and conditions of quantum advantage over classical strategies are examined. Furthermore, theoretical, computational, and experimental techniques are presented that can be useful in the analysis and implementation of quantum strategies in these types of games.

•Jan 1, 2018•0 citations

Quantization of blackjack: Quantum basic strategy and advantage

Yushi Mura, Hiroki Wada

Abstract Quantum computers that process information by harnessing the remarkable power of quantum mechanics are increasingly being put to practical use. In the future, their impact will be felt in numerous fields, including in online casino games. This is one of the reasons why quantum gambling theory has garnered considerable attention. Studies have shown that quantum gambling theory often yields nontrivial consequences that classical theory cannot interpret. We have formulated blackjack, one of the most famous card games, as a quantum game and found possible quantum entanglement between strategies. We also devised a quantum circuit reproducing classical blackjack. This circuit can be realized in the near future when quantum computers are commonplace. Furthermore, we showed that the player’s expectation increases compared to the classical game using quantum basic strategy, which is a quantum version of the popular basic strategy of blackjack.

arXiv:2011.12342•Progress of Theoretical and Experimental Physics•Sep 29, 2021•3 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

Advantage of a quantum player over a classical one in 2 × 2 quantum games

Adrian P. Flitney, Derek Abbott

We study a general 2 × 2 symmetric entangled quantum game. When one player has access only to classical strategies, while the other can use the full range of quantum strategies, there are ‘miracle’ moves available to the quantum player that can direct the game towards the quantum player's preferred result regardless of the classical player's strategy. The advantage pertaining to the quantum player is dependent on the degree of entanglement. Below a critical level, dependent on the pay–offs in the game, the miracle move is of no advantage.

arXiv:quant-ph/0209121•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 16, 2003•95 citations

A necessary and sufficient condition to play games in quantum mechanical settings

Şahin Kaya Özdemir, Junichi Shimamura, N. Imoto

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

arXiv:quant-ph/0508105•New Journal of Physics•Feb 28, 2007•59 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
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.
In this thesis, we examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we particularly focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the first-mover to the late-mover. Within this setting, optimal usage of quantum entanglement is explored, and conditions of quantum advantage over classical strategies are examined. Furthermore, theoretical, computational, and experimental techniques are presented that can be useful in the analysis and implementation of quantum strategies in these types of games.
Abstract Quantum computers that process information by harnessing the remarkable power of quantum mechanics are increasingly being put to practical use. In the future, their impact will be felt in numerous fields, including in online casino games. This is one of the reasons why quantum gambling theory has garnered considerable attention. Studies have shown that quantum gambling theory often yields nontrivial consequences that classical theory cannot interpret. We have formulated blackjack, one of the most famous card games, as a quantum game and found possible quantum entanglement between strategies. We also devised a quantum circuit reproducing classical blackjack. This circuit can be realized in the near future when quantum computers are commonplace. Furthermore, we showed that the player’s expectation increases compared to the classical game using quantum basic strategy, which is a quantum version of the popular basic strategy of blackjack.
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 study a general 2 × 2 symmetric entangled quantum game. When one player has access only to classical strategies, while the other can use the full range of quantum strategies, there are ‘miracle’ moves available to the quantum player that can direct the game towards the quantum player's preferred result regardless of the classical player's strategy. The advantage pertaining to the quantum player is dependent on the degree of entanglement. Below a critical level, dependent on the pay–offs in the game, the miracle move is of no advantage.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
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.