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:quant-ph/0011078

Quantum Strategy Without Entanglement

Jiangfeng Du, Xiaodong Xu, Hui Li, Mingjun Shi, Xianyi Zhou, Rongdian Han

Published Nov 19, 2000• 14 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0011078

Related papers

Experimental demonstration of quantum gain in a zero-sum game

Chong Zu, Y.-X. Wang, X.-Y. Chang +3 more

We propose and experimentally demonstrate a zero-sum game that is in a fair Nash equilibrium for classical players, but has the property that a quantum player can always win using an appropriate strategy. The gain of the quantum player is measured experimentally for different quantum strategies and input states. It is found that the quantum gain is maximized by a maximally entangled state, but does not decrease to zero when entanglement disappears. Instead, it links with another kind of quantum correlation described by discord for the qubit case and the connection is demonstrated both theoretically and experimentally.

New Journal of Physics•Mar 1, 2012•18 citations

Experimental demonstration of quantum gain in a zero-sum game

Chong Zu, Yuexuan Wang, Xiuying Chang +3 more

We propose and experimentally demonstrate a zero-sum game that is in a fair Nash equilibrium for classical players, but has the property that a quantum player can always win using an appropriate strategy. The gain of the quantum player is measured experimentally for different quantum strategies and input states. It is found that the quantum gain is maximized by a maximally entangled state, but does not decrease to zero when entanglement disappears. Instead, it links with another kind of quantum correlation described by discord for the qubit case and the connection is demonstrated both theoretically and experimentally.

APS•Jun 1, 2012•3 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•2 citations

Optimal Guessing Strategies in a Quantum Card Game

Chih‐Lung Chou, Li‐Yi Hsu

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice's card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob's best strategy for guessing Alice's card is to measure his two cards collectively.

arXiv:quant-ph/0206167•Jun 24, 2002•0 citations

Quantum Chinos game: winning strategies through quantum fluctuations

F. Guinea, Miguel Angel Martin-Delgado

We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.

arXiv:quant-ph/0201140•Journal of Physics A Mathematical and General•Mar 19, 2003•17 citations

Quantum games and quantum algorithms

DAVID A. MEYER

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein-Vazirani quantum search algorithm which I show creates no entanglement at any timestep.

arXiv:quant-ph/0004092•Apr 24, 2000•3 citations
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.
We propose and experimentally demonstrate a zero-sum game that is in a fair Nash equilibrium for classical players, but has the property that a quantum player can always win using an appropriate strategy. The gain of the quantum player is measured experimentally for different quantum strategies and input states. It is found that the quantum gain is maximized by a maximally entangled state, but does not decrease to zero when entanglement disappears. Instead, it links with another kind of quantum correlation described by discord for the qubit case and the connection is demonstrated both theoretically and experimentally.
We propose and experimentally demonstrate a zero-sum game that is in a fair Nash equilibrium for classical players, but has the property that a quantum player can always win using an appropriate strategy. The gain of the quantum player is measured experimentally for different quantum strategies and input states. It is found that the quantum gain is maximized by a maximally entangled state, but does not decrease to zero when entanglement disappears. Instead, it links with another kind of quantum correlation described by discord for the qubit case and the connection is demonstrated both theoretically and experimentally.
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 apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.