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:2011.12342 · Progress of Theoretical and Experimental Physics

Quantization of blackjack: Quantum basic strategy and advantage

Yushi Mura, Hiroki Wada

Published Sep 29, 2021• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1093/ptep/ptab125

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•8 citations

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

Quantized Poker

Steven A. Bleiler

Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet in on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played in the coming quantum computing environment or when played with quantum information. In almost all cases, the "quantized" versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played in the coming quantum computation environment. The analysis here shows that for certain players, "entangled" poker will allow results that outperform those available to players "in real life".

arXiv:0902.2196•Feb 12, 2009•4 citations

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

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

Quantum Games and Programmable Quantum Systems

Edward W. Piotrowski, Jan Sładkowski

Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.

arXiv:quant-ph/0504010•Apr 2, 2005•3 citations
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.
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.
Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet in on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played in the coming quantum computing environment or when played with quantum information. In almost all cases, the "quantized" versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played in the coming quantum computation environment. The analysis here shows that for certain players, "entangled" poker will allow results that outperform those available to players "in real life".
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.
Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.