© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Photonic Network Communications

Secret Information Sharing using Multipartite Entanglement in Monty Hall Game

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

Published May 9, 2024• 0 citations

Abstract

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.

DOI: 10.1007/s11107-024-01017-4

Related papers

Analyzing the efficiency of partially entangled states in Vaidman’s-type games and its applications in Quantum Secret Sharing

Hargeet Kaur, Atul Kumar

We analyze the role of degree of entanglement for Vaidman’s game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman’s game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players. For practical purposes, the analysis is extended to study the proposed game under noisy conditions. In addition, the results obtained here are also generalized for multi-qubit games.

arXiv:1807.06950•International Journal of Computers and Applications•Apr 26, 2018•0 citations

Analysing the role of entanglement in the three-qubit Vaidman's game

Hargeet Kaur, Atul Kumar

We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman's game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players.

arXiv:1807.05262•International Conference on Intelligent Communication and Computational Techniques (ICCT)•Dec 1, 2017•1 citation

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

The quantum monty hall problem

Giacomo Mauro D’Ariano, Richard David Gill, Michael Keyl +3 more

We consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be considered. It can be phrased as a two person game between a player P and a quiz master Q. Then P always has a strategy at least as good as in the classical case, while Q's best strategy results in a game having the same value as the classical game. We investigate the consequences of Q storing his information in classical or quantum ways. It turns out that Q's optimal strategy is to use a completely entangled quantum notepad, on which to encode his prior information.

arXiv:quant-ph/0202120•Quantum Information and Computation•Aug 1, 2002•39 citations

Quantum Version of a Generalized Monty Hall Game and Its Possible Applications to Quantum Secure Communications

Luis Fernando Quezada, Shi‐Hai Dong

Abstract In this work, the authors 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, the authors extend the 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, multi‐party, key‐distribution quantum protocols.

arXiv:2010.13771•Annalen der Physik•Nov 10, 2020•15 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

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 analyze the role of degree of entanglement for Vaidman’s game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman’s game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players. For practical purposes, the analysis is extended to study the proposed game under noisy conditions. In addition, the results obtained here are also generalized for multi-qubit games.

We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman's game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players.

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.

We consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be considered. It can be phrased as a two person game between a player P and a quiz master Q. Then P always has a strategy at least as good as in the classical case, while Q's best strategy results in a game having the same value as the classical game. We investigate the consequences of Q storing his information in classical or quantum ways. It turns out that Q's optimal strategy is to use a completely entangled quantum notepad, on which to encode his prior information.

Abstract In this work, the authors 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, the authors extend the 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, multi‐party, key‐distribution quantum protocols.

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.