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

Journal of Physics A Mathematical and Theoretical

Quantum duel revisited

Alexandre G. M. Schmidt, Milena M Paiva

Published Mar 6, 2012• 14 citations
Publisher

Abstract

We revisit the quantum two-person duel. In this problem, both Alice and Bob each possess a spin-1/2 particle which models dead and alive states for each player. We review the Abbott and Flitney result—now considering non-zero α1 and α2 in order to decide if it is better for Alice to shoot or not the second time—and we also consider a duel where players do not necessarily start alive. This simple assumption allows us to explore several interesting special cases, namely how a dead player can win the duel shooting just once, or how can Bob revive Alice after one shot, and the better strategy for Alice—being either alive or in a superposition of alive and dead states—fighting a dead opponent.

DOI
10.1088/1751-8113/45/12/125304

Related papers

Simultaneous Quantum Duel

W. F. Balthazar, J. A. O. Huguenin, Alexandre G. M. Schmidt

We quantize the classical game of simultaneous two-person duel. In this game, the players Alice and Bob, have a two level system, for example, a spin 1/2 particle, which models alive and dead states. Through physical considerations we write up the unitary operator which represents the classical action of firing, which quantum mechanically is represented by flipping the opponent’s spin and test its classical limits. We study three representative special cases of such duel where players start the duel: both alive; in a Bell state; and when one of them has her skills decreasing along the duel. We also present a proposal of experimental realization of this quantum game using twin photons produced by spontaneous parametric down conversion.

Journal of the Physical Society of Japan•Nov 10, 2015•3 citations

Quantum two- and three-person duels

Adrian P. Flitney, Derek Abbott

In game theory, a popular model of a struggle for survival among three competing agents is a truel, or three-person generalization of a duel. Adopting the ideas recently developed in quantum game theory, we present a quantum scheme for the problems of duels and truels. In the classical case, the outcome is sensitive to the precise rules under which the truel is performed and can be counterintuitive. These aspects carry over into our quantum scheme, but interference amongst the players' strategies can arise, leading to game equilibria different from the classical case.

arXiv:quant-ph/0305058•Journal of Optics B Quantum and Semiclassical Optics•Jul 28, 2004•37 citations

Experimental realization of the quantum duel game using linear optical circuits

W. F. Balthazar, M. H. M. Passos, Alexandre G. M. Schmidt +2 more

Abstract We report on the experimental realization of the quantum duel game for two players, Alice and Bob. Using an all optical approach, we have encoded Alice and Bob states in transverse modes and polarization degrees of freedom of a laser beam, respectively. By setting Alice and Bob input states and considering the possibility of Alice performing two shots, we demonstrated the quantum features of the game as well as we recovered the classical version of the game.

Journal of Physics B Atomic Molecular and Optical Physics•Jul 10, 2015•19 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

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

A Study of Quantum Strategies for Newcomb's Paradox

Takashi Mihara

Newcomb’s problem is a game between two players, one of who has an ability to predict the future: let Bob have an ability to predict Alice’s will. Now, Bob prepares two boxes, Box1 and Box2, and Alice can select either Box2 or both boxes. Box1 contains $1. Box2 contains $1,000 only if Alice selects only Box2; otherwise Box2 is empty($0). Which is better for Alice? Since Alice cannot decide which one is better in general, this problem is called Newcomb’s paradox. In this paper, we propose quantum strategies for this paradox by Bob having quantum ability. Many other results including quantum strategies put emphasis on finding out equilibrium points. On the other hand, our results put emphasis on whether a player can predict another player’s will. Then, we show some positive solutions for this problem.

iBusiness•Jan 1, 2010•0 citations
We revisit the quantum two-person duel. In this problem, both Alice and Bob each possess a spin-1/2 particle which models dead and alive states for each player. We review the Abbott and Flitney result—now considering non-zero α1 and α2 in order to decide if it is better for Alice to shoot or not the second time—and we also consider a duel where players do not necessarily start alive. This simple assumption allows us to explore several interesting special cases, namely how a dead player can win the duel shooting just once, or how can Bob revive Alice after one shot, and the better strategy for Alice—being either alive or in a superposition of alive and dead states—fighting a dead opponent.
We quantize the classical game of simultaneous two-person duel. In this game, the players Alice and Bob, have a two level system, for example, a spin 1/2 particle, which models alive and dead states. Through physical considerations we write up the unitary operator which represents the classical action of firing, which quantum mechanically is represented by flipping the opponent’s spin and test its classical limits. We study three representative special cases of such duel where players start the duel: both alive; in a Bell state; and when one of them has her skills decreasing along the duel. We also present a proposal of experimental realization of this quantum game using twin photons produced by spontaneous parametric down conversion.
In game theory, a popular model of a struggle for survival among three competing agents is a truel, or three-person generalization of a duel. Adopting the ideas recently developed in quantum game theory, we present a quantum scheme for the problems of duels and truels. In the classical case, the outcome is sensitive to the precise rules under which the truel is performed and can be counterintuitive. These aspects carry over into our quantum scheme, but interference amongst the players' strategies can arise, leading to game equilibria different from the classical case.
Newcomb’s problem is a game between two players, one of who has an ability to predict the future: let Bob have an ability to predict Alice’s will. Now, Bob prepares two boxes, Box1 and Box2, and Alice can select either Box2 or both boxes. Box1 contains $1. Box2 contains $1,000 only if Alice selects only Box2; otherwise Box2 is empty($0). Which is better for Alice? Since Alice cannot decide which one is better in general, this problem is called Newcomb’s paradox. In this paper, we propose quantum strategies for this paradox by Bob having quantum ability. Many other results including quantum strategies put emphasis on finding out equilibrium points. On the other hand, our results put emphasis on whether a player can predict another player’s will. Then, we show some positive solutions for this problem.