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/0505120 · International Journal of Theoretical Physics

How To Play Two-Player Restricted Quantum Games with 10 Cards

Diederik Aerts, Bart D’Hooghe, Andrzej Posiewnik, Jarosław Pykacz, Jeroen Dehaene, Bart De Moor

Published Jul 18, 2007• 2 citations
arXivHTMLPDF
DOI
10.1007/s10773-007-9466-3

Related papers

Macroscopic quantum games (or how to play a quantum game with a pack of 10 cards)

Diederik Aerts

•Jan 1, 2006•0 citations

Probabilistic analysis of three-player symmetric quantum games played using EPR setting

Azhar Iqbal, Taksu Cheon, Derek Abbott

•Apr 15, 2008•0 citations

Probabilistic analysis of three-player symmetric quantum games played using the Einstein–Podolsky–Rosen–Bohm setting

Azhar Iqbal, Taksu Cheon, Derek Abbott

arXiv:0804.2304•Physics Letters A•Sep 21, 2008•36 citations

Playing games with EPR-type experiments

Azhar Iqbal

An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.

arXiv:quant-ph/0507152•Journal of Physics A Mathematical and General•Oct 12, 2005•15 citations

Card-Based Computation in the Virtual Player Simulation Model

Suthee Ruangwises

Player simulation has recently emerged as a new direction in card-based cryptography, with protocols developed for simulating virtual players in physical card games such as Old Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.

arXiv:2609.02716•Sep 2, 2026•0 citations

Cooperative three- and four-player quantum games

Ying Jun Ma, Gui Lu Long, Fu Guo Deng +2 more

arXiv:quant-ph/0208075•Physics Letters A•Aug 1, 2002•10 citations
Player simulation has recently emerged as a new direction in card-based cryptography, with protocols developed for simulating virtual players in physical card games such as Old Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.