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

IEEE International Conference on Advanced Networks and Telecommunications Systems

Decoherence effects in the quantum Monty Hall solution using W state

Hargeet Kaur, Kavit Shah, Debabrata Swain, Kaushal Arvindbhai Shah

Published Dec 18, 2022• 1 citation
Publisher

Abstract

The emergence of quantum computing has made us utilize its powers in solving the Monty Hall problem. The problem is depicted as a two-player game, where the two players, i.e. the host and the participant share an entangled three-qubit quantum state between them. The quantum state of three qubits is closely knit with the fact that behind which door would one expect the prize of the game to be. The two players are part of one team as they share a quantum communication channel amongst them by sharing the entangled state as a quantum resource. The article shows a unique way of utilizing the effectiveness and entanglement features of the W state as a source of communication in disguise for solving the Monty Hall problem. It is shown that by sharing the W state, the players always win the prize. Moreover, since Noisy Intermediate-Scale Quantum technology is the need of the hour, the effects of decoherence are also observed on the winning prospects of the game.

DOI
10.1109/ants56424.2022.10227767

Related papers

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

Environmental influences on Quantum Monty Hall problem

Salman Khan, Muhammad Asif Ramzan, Majid Khan

We reformulate the quantum Monty Hall problem in the presence of decoherence. The decoherence destroys the fairness of the game. A new Nash equilibrium for a particular strategy profile in the presence of decoherence emerges. It is shown that in the presence of decoherence under the action of amplitude damping channel, Bob's winning probability is always higher than three-forth, irrespective of Alice's strategy, if he does not switch to the other door and always wins for a fully decohered case of the channel. Depolarizing channel damps up Bob's winning probability and gets better off if he sticks to his current selection. Phase damping channel leaves the winning probability unaffected. Unlike the classical and the quantum forms of the game, Bob's dominant strategy in the presence of decoherence is not switching.

arXiv:1010.4875•Oct 23, 2010•0 citations

THE QUANTUM MONTY HALL PROBLEM: SYMMETRY, ENTANGLEMENT, AND STATE MODIFICATION

Michael Aksman

The classical Monty Hall problem serves as a standard exercise in conditional probability. In this article, we examine its quantum mechanical extension to demonstrate how classical probability distributions are governed by symmetry and entanglement. By mapping the available choices to a three-level quantum system (qutrits) governed by SU(3) symmetry, the game is transformed into a formalized quantum system [1]. We establish that when the choices of the host and player are entangled, the act of revealing a door functions as a symmetry-breaking measurement that physically modifies the state space, illustrating that information acquisition in quantum systems is an active, geometric process with direct analogues in quantum field symmetries [2].

•Feb 21, 2026•0 citations

Quantum version of the Monty Hall problem

Adrian P. Flitney, Derek Abbott

A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than that obtained with a classical mixed strategy. However, if the initial state involves entanglement of the qutrits of the two players, it is advantageous for one player to have access to a quantum strategy while the other does not. Where both players have access to quantum strategies there is no Nash equilibrium in pure strategies, however, there is a Nash equilibrium in quantum mixed strategies that gives the same average payoff as the classical game.

arXiv:quant-ph/0109035•Physical Review A•Jun 14, 2002•125 citations

Quantum-Optical set-up for the Monty Hall problem

Luis Fernando Quezada, A. Martín-Ruiz, Adam Frank +1 more

Abstract A quantum version of the Monty Hall problem is proposed inspired by an experimentally-feasible, quantum-optical set-up that resembles the classical game. The expected payoff of the player is studied by analyzing the classical expectation values of the obtained quantum probabilities. Results are examined by considering both entanglement and non-entanglement between player and host, and using two different approaches: random and strategy-based. We also discuss the influence of noise on the game outcome when the parties play through a noisy quantum channel. The experimental set-up can be used to quickly verify the counter-intuitive result of the Monty Hall problem, adding pedagogic value to the proposal.

arXiv:1908.05774•Physica Scripta•Apr 2, 2020•4 citations

Communication Power of a Noisy Qubit

Giulio Chiribella, Saptarshi Roy, Tamal Guha +1 more

A fundamental limitation of quantum communication is that a single qubit can carry at most one bit of classical information. For an important class of quantum communication channels, known as entanglement breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the "prize") hidden in one of four possible boxes, while avoiding a hazardous item (the "bomb") hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum not channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.

Physical Review Letters•Feb 28, 2025•3 citations
The emergence of quantum computing has made us utilize its powers in solving the Monty Hall problem. The problem is depicted as a two-player game, where the two players, i.e. the host and the participant share an entangled three-qubit quantum state between them. The quantum state of three qubits is closely knit with the fact that behind which door would one expect the prize of the game to be. The two players are part of one team as they share a quantum communication channel amongst them by sharing the entangled state as a quantum resource. The article shows a unique way of utilizing the effectiveness and entanglement features of the W state as a source of communication in disguise for solving the Monty Hall problem. It is shown that by sharing the W state, the players always win the prize. Moreover, since Noisy Intermediate-Scale Quantum technology is the need of the hour, the effects of decoherence are also observed on the winning prospects of the game.
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.
We reformulate the quantum Monty Hall problem in the presence of decoherence. The decoherence destroys the fairness of the game. A new Nash equilibrium for a particular strategy profile in the presence of decoherence emerges. It is shown that in the presence of decoherence under the action of amplitude damping channel, Bob's winning probability is always higher than three-forth, irrespective of Alice's strategy, if he does not switch to the other door and always wins for a fully decohered case of the channel. Depolarizing channel damps up Bob's winning probability and gets better off if he sticks to his current selection. Phase damping channel leaves the winning probability unaffected. Unlike the classical and the quantum forms of the game, Bob's dominant strategy in the presence of decoherence is not switching.
The classical Monty Hall problem serves as a standard exercise in conditional probability. In this article, we examine its quantum mechanical extension to demonstrate how classical probability distributions are governed by symmetry and entanglement. By mapping the available choices to a three-level quantum system (qutrits) governed by SU(3) symmetry, the game is transformed into a formalized quantum system [1]. We establish that when the choices of the host and player are entangled, the act of revealing a door functions as a symmetry-breaking measurement that physically modifies the state space, illustrating that information acquisition in quantum systems is an active, geometric process with direct analogues in quantum field symmetries [2].
A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than that obtained with a classical mixed strategy. However, if the initial state involves entanglement of the qutrits of the two players, it is advantageous for one player to have access to a quantum strategy while the other does not. Where both players have access to quantum strategies there is no Nash equilibrium in pure strategies, however, there is a Nash equilibrium in quantum mixed strategies that gives the same average payoff as the classical game.
Abstract A quantum version of the Monty Hall problem is proposed inspired by an experimentally-feasible, quantum-optical set-up that resembles the classical game. The expected payoff of the player is studied by analyzing the classical expectation values of the obtained quantum probabilities. Results are examined by considering both entanglement and non-entanglement between player and host, and using two different approaches: random and strategy-based. We also discuss the influence of noise on the game outcome when the parties play through a noisy quantum channel. The experimental set-up can be used to quickly verify the counter-intuitive result of the Monty Hall problem, adding pedagogic value to the proposal.
A fundamental limitation of quantum communication is that a single qubit can carry at most one bit of classical information. For an important class of quantum communication channels, known as entanglement breaking, this limitation holds even if the sender and receiver share entangled particles. But does this mean that, for the purpose of communicating classical messages, a noisy entanglement-breaking qubit channel can be replaced by a noisy bit channel? Here we answer the question in the negative. We introduce a game, similar to the Monty Hall problem in classical statistics, where a sender assists a receiver in finding a valuable item (the "prize") hidden in one of four possible boxes, while avoiding a hazardous item (the "bomb") hidden in one of the remaining three boxes. We show that no classical strategy using a noisy bit channel can ensure that the bomb is avoided, even if the sender and receiver share arbitrary amounts of randomness. In contrast, communication of a qubit through a class of noisy entanglement-breaking channels, which we call quantum not channels, allows the players to deterministically avoid the bomb and to find the prize with a guaranteed nonzero probability. Our findings show that the communication of classical messages through a noisy entanglement-breaking qubit channel assisted by quantum entanglement cannot, in general, be simulated by communication through a noisy bit channel assisted by classical correlations.