首页/论文/2005.05463

arXiv 2005.054632020-05quant-ph

Quantum Key-Distribution Protocols Based on a Quantum Version of the Monty Hall Game

L. F. Quezada, Shi-Hai Dong

发表信息：: Ann. Phys. (Berlin) 532, 2000126 (2020)
DOI：: 10.1002/andp.202000126

英文摘要：

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) protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott. Unlike most QKD protocols, in which the bits from which the key is going to be extracted are encoded in a basis choice (as in BB84), these are encoded in an operation choice. The first proposed protocol uses qutrits to describe the state of the system and the same game operators proposed by Flitney and Abbott. The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates. In both protocols, the security relies on the violation of a Bell-type inequality, for two qutrits and for six qubits in each case. Results show a higher ratio of violation than the E91 protocol.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

EPR, Bell, Schrodinger's cat, and the Monty Hall Paradox

The purpose of this manuscript is to provide a short pedagogical explanation why "quantum collapse" is not a metaphysical event, by pointing out the analogy with a "classical collapse" which is associated with the Monty Hall Paradox.

2007-04-09quant-ph

Noisy quantum Monty Hall game

The influence of spontaneous emission channel and generalized Pauli channel on quantum Monty Hall Game is analysed. The scheme of Flittney and Abbott is reformulated using the formalism of density matrices. Optimal classical strategies for given quantum strategies are found. The whole presented scheme illustrates how quantum noise may change the odds of a zero-sum game.

2009-11-02quant-ph

Quantum inferring acausal structures and the Monty Hall problem

This paper presents a quantum version of the Monty Hall problem based upon the quantum inferring acausal structures, which can be identified with generalization of Bayesian networks. Considered structures are expressed in formalism of quantum information theory, where density operators are identified with quantum generalization of probability distributions. Conditional relations between quantum counterpart of random variables are described by quantum conditional operators. Presented quantum inferring structures are used to construct a model inspired by scenario of well-known Monty Hall game, w…

2016-09-07quant-ph

Quantum PBR Theorem as a Monty Hall Game

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 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 to quantum teleportation, in particular for improving reliability.

2019-09-19quant-ph

Quantum-Optical set-up for the Monty Hall problem

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 …

2020-04-02quant-ph

Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications

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, specifical…

2020-10-30quant-ph

更多相关论文收起更多论文

Playing Quantum Monty Hall Game in a Quantum Computer

Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering work, Flitney and Abbott [Phys. Rev. A 65, 062318 (2002)] showed that by using a maximally entangled system for Alice and Bob's choices, and using quantum strategies, Bob and Alice can win or lose depending on the strategy chosen by either of the players. Here we develop a new quantum algorithm with quantum circuits for playing the quantum Monty Hall game by a …

2019-01-22quant-ph

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, there is a Nash equilibrium of the game in case of depolarizing channel for Alice's quantum strategy. Where as in case of dephasing noise, the game is not influenced by the quantum channel. For amplitude damping channel, the Bob's payoffs are found symmetrical with maximum at p=0.5 against his classical strategy. However, it is worth-mentioning that in case of depolarizing channel, Bob's classical strat…

2009-07-14quant-ph

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 offers the players nothing more than can be obtained with a classical mixed strategy. However, if the initial state involves entanglement of the qubits 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 equili…

2002-06-18quant-ph

Environmental influences on Quantum Monty Hall problem

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 sti…

2012-03-27quant-ph

The Quantum Monty Hall Problem

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…

2002-02-21quant-ph

通过量子测量类比理解蒙提霍尔问题

Understanding the Monty Hall Problem Through a Quantum Measurement Analogy

本文提出一种受量子测量理论启发的解释框架，将蒙提霍尔问题中主持人开门揭示非奖品的行为类比为导致概率分布不对称坍缩的量子测量，该框架不仅阐明了直觉误解的成因，还提供了与标准贝叶斯结果一致的广义公式，并经蒙特卡洛模拟验证，为理解条件概率现象提供了有效的教学工具。

2025-05-17math.HOmath.PRquant-ph

单qutrit的非语境决定论的Monty-Hall检验

Entanglement as a Witness of Quantum Coherence: A Bipartite Monty-Hall Protocol

Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional（墨西哥国立理工学院高级研究与创新中心）

通过一个三能级系统，提出一种区分非语境确定性隐变量理论与量子力学的简单等式，基于Monty Hall谜题，量子力学预测的概率为1/6，而NCHV理论为1/3，从而提供一种状态依赖的非语境性不等式。

2026-06-16math-phmath.MPquant-ph

Quantum strategies of quantum measurement

In classical Monty Hall problem, one player can always win with probability 2/3. We generalize the problem to the quantum domain and show that a fair two-party zero-sum game can be carried out if the other player is permitted to adopt quantum measurement strategy.

2001-07-10quant-ph