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.

中文翻译：

---

基于Monty Hall游戏的量子版本的量子密钥分配协议

这项工作说明了量子博弈论在量子信息领域，特别是在量子密码学领域的可能应用。该研究基于Flitney和Abbott设计的Monty Hall游戏的量子版本，提出了两种量子密钥分配（QKD）协议。与大多数QKD协议不同（在QKD协议中，将要从中提取密钥的位在基本选择中进行编码（如BB84中所述），这些在操作选择中进行编码。最早提出的协议使用Qutrit来描述系统的状态，并使用Flitney和Abbott提出的相同游戏运营商。第二个提议的动机是通过使qutrit协议的形式主义适应使用qubit和简单的逻辑量子门来简化可能的物理实现。在这两种协议中 安全性依赖于违反贝尔型不等式的情况，在每种情况下，两个qutrit和六个qubit。结果显示比E91协议更高的违规率。