Quantum-Optical set-up for the Monty Hall problem

  title={Quantum-Optical set-up for the Monty Hall problem},
  author={Luis Fernando Quezada and Alberto Mart'in-Ruiz and Alejandro Frank and Eduardo Nahmad-Achar},
  journal={Physica Scripta},
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… 
2 Citations
Quantum Version of a Generalized Monty Hall Game and Its Possible Applications to Quantum Secure Communications
This work proposes a quantum version of a generalized Monty Hall game, that is, one in which the parameters of the game are left free, and not fixed on its regular values, and extends its quantum scheme to include multiple independent players.
Quantum Key‐Distribution Protocols Based on a Quantum Version of the Monty Hall Game
This work illustrates a possible application of quantum game theory to the area of quantum information, in particular to quantum cryptography. The study proposed two quantum key‐distribution (QKD)


Quantum version of the Monty Hall problem
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
The quantum monty hall problem
It turns out that Q's optimal strategy is to use a completely entangled quantum notepad, on which to encode his prior information.
The influence of spontaneous emission channel and generalized Pauli channel on quantum Monty Hall Game is analyzed. The scheme of Flittney and Abbott is reformulated using the formalism of density
Quantum PBR Theorem as a Monty Hall Game
The quantum Pusey--Barrett--Rudolph (PBR) theorem is reformulate as a Monty Hall game, and it is shown that winning probabilities, for switching doors in the game, depend whether it is a $\psi$-ontic or $psi-epistemic game.
Quantum Monty Hall Problem under Decoherence
We study the effect of decoherence on quantum Monty Hall problem under the influence of amplitude damping, depolarizing, and dephasing channels. It is shown that under the effect of decoherence,
Multiplayer quantum Minority game with decoherence
A quantum version of the Minority game for an arbitrary number of agents is studied. When the number of agents is odd, quantizing the game produces no advantage to the players, however, for an even
Playing a quantum game with a corrupted source
The quantum advantage arising in a simplified multiplayer quantum game is found to be a disadvantage when the game's qubit source is corrupted by a noisy ``demon.'' Above a critical value of the
Quantum Gambling
This Letter presents a secure two-party quantum cryp graphic task—“quantum gambling,” which has no class cal counterpart and is skeptical about the existence of a secure quantum coin tossin protocol.
Quantum strategies
It is proved that in general a quantum strategy is always at least as good as a classical one, and furthermore that when both players use quantum strategies there need not be any equilibrium, but if both are allowed mixed quantum strategiesthere must be.