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

WORLD SCIENTIFIC eBooks

At the doors of quantum games

Published Aug 27, 2020• 0 citations
Publisher
DOI
10.1142/9789811214868_0007

Related papers

At the doors of quantum games

Vassili Nikitich Kolokoltsov, Oleg Malafeyev

AbstractThe following sections are included:Quantum bits and Schrödinger's catLattices and quantum logicRendezvous of Bob and Alice

WORLD SCIENTIFIC eBooks•Jan 1, 2010•0 citations

Quantum games

J.M.A Figueiredo

Physica A Statistical Mechanics and its Applications•Jan 27, 2004•1 citation

Quantum PBR Theorem as a Monty Hall Game

Del Rajan, Matt Visser

The quantum Pusey–Barrett–Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a ψ-ontic model (system’s physical state) or to a ψ-epistemic model (observer’s knowledge about the system). We reformulate the PBR theorem as a Monty Hall game and show that winning probabilities, for switching doors in the game, depend on whether it is a ψ-ontic or ψ-epistemic game. For certain cases of the latter, switching doors provides no advantage. We also apply the concepts involved in quantum teleportation, in particular for improving reliability.

arXiv:1909.06771•Quantum Reports•Dec 31, 2019•8 citations

Quantum games

Παναγιώτης Αποστολίδης, Εύαγγελος Κ. Κοντονικολάου

•Jan 1, 2025•0 citations

Secret Information Sharing using Multipartite Entanglement in Monty Hall Game

Hargeet Kaur, Kavit Shah, Debabrata Swain +1 more

Abstract Quantum computing has emerged as a useful resource for winning random games. Monty Hall problem is one such game where the powers of quantum mechanics can be utilized for winning the prize. Our paper depicts this problem as a two-player game, where the two players, i.e. the host and the participant share an entangled quantum state. The entangled state is closely knit with the position of the prize containing door, and the decision of the player i.e. either switch or stay from his initial choice of door. The two players are part of one team as they share a quantum communication channel among them by sharing the entangled state as a quantum resource. This enables them to share share secret information about the position of the price as well as the strategy to opt for winning the game. The article shows a unique way of utilizing three different type of entangled states, 3-qubit symmetric W state, 3-qubit X state, and 5-qubit highly entangled Brown state. Further, the effectiveness of each quantum state as a source of communication in disguise is also compared. All the entangled states under study assure winning the price by the participant. However, each quantum state has different entanglement degree and offer varied merits as per the game setting.

Photonic Network Communications•May 9, 2024•1 citation

On Quantum Team Games

E. Ahmed, Mohammed Fathy Elettreby, Ahmed Sadek Hegazi

International Journal of Theoretical Physics•Mar 21, 2006•16 citations
The quantum Pusey–Barrett–Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a ψ-ontic model (system’s physical state) or to a ψ-epistemic model (observer’s knowledge about the system). We reformulate the PBR theorem as a Monty Hall game and show that winning probabilities, for switching doors in the game, depend on whether it is a ψ-ontic or ψ-epistemic game. For certain cases of the latter, switching doors provides no advantage. We also apply the concepts involved in quantum teleportation, in particular for improving reliability.
Abstract Quantum computing has emerged as a useful resource for winning random games. Monty Hall problem is one such game where the powers of quantum mechanics can be utilized for winning the prize. Our paper depicts this problem as a two-player game, where the two players, i.e. the host and the participant share an entangled quantum state. The entangled state is closely knit with the position of the prize containing door, and the decision of the player i.e. either switch or stay from his initial choice of door. The two players are part of one team as they share a quantum communication channel among them by sharing the entangled state as a quantum resource. This enables them to share share secret information about the position of the price as well as the strategy to opt for winning the game. The article shows a unique way of utilizing three different type of entangled states, 3-qubit symmetric W state, 3-qubit X state, and 5-qubit highly entangled Brown state. Further, the effectiveness of each quantum state as a source of communication in disguise is also compared. All the entangled states under study assure winning the price by the participant. However, each quantum state has different entanglement degree and offer varied merits as per the game setting.