Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications
arXiv:2010.13771 · doi:10.1002/andp.202000427
Abstract
In this work we propose 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. The developed quantum scheme is then used to study the expected payoff of the player, using both a separable and an entangled initial-state. In the two cases, the classical mixed-strategy payoff is recovered under certain conditions. Lastly, we extend our quantum scheme to include multiple independent players, and use this extension to sketch two possible application of the game mechanics to quantum networks, specifically, two validated, mult-party, key-distribution, quantum protocols.
References in corpus (19)
- Quantum Games and Quantum Strategies
- Quantum strategies
- Multi-Player Quantum Games
- Operational Quantum Mechanics, Quantum Axiomatics and Quantum Structures
- Comment on `Quantum Games and Quantum Strategies'
- Classical Rules in Quantum Games
- Quantum version of the Monty Hall problem
- Quantum Market Games
- Nash equilibria in quantum games with generalized two-parameter strategies
- Quantum games with decoherence
- Advantage of a quantum player over a classical one in 2x2 quantum games
- Quantum strategies of quantum measurement
- Quantum coherence, correlated noise and Parrondo games
- Constructing quantum games from symmetric non-factorizable joint probabilities
- Quantum Key-Distribution Protocols Based on a Quantum Version of the Monty Hall Game
- A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement
- Quantum inferring acausal structures and the Monty Hall problem
- Quantum Monty Hall problem under decoherence
- Quantum-Optical set-up for the Monty Hall problem