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

• URL: http://arxiv.org/abs/2010.13771v3
• Date: Fri, 30 Oct 2020 00:58:58 GMT
• Title: Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications
• Authors: L. F. Quezada and Shi-Hai Dong
• Abstract summary: We propose a quantum version of a generalized Monty Hall game, in which the parameters of the game are left free, and not fixed on its regular values. 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• A quantum cloning game with applications to quantum position verification [0.0]
  We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input. We provide the optimal winning probability of such a game for every number of parties $k$, and show that it decays exponentially when the game is played $n$ times in parallel.
  arXiv  Detail & Related papers  (2024-10-29T15:53:19Z)
• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Permissible extensions of classical to quantum games combining three strategies [0.0]
  We study the extension of classical games to the quantum domain. We use the obtained results to extend the classical Prisoner's Dilemma game to a quantum game.
  arXiv  Detail & Related papers  (2024-04-09T10:38:10Z)
• Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement [0.0]
  We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol. We find that how two pure strategies fare against each other is crucially dependent on the discount factor. In the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.
  arXiv  Detail & Related papers  (2023-12-08T15:54:51Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Nonclassical rules in quantum games [0.0]
  A model of quantum playing a 2x2 game introduced by J. Eisert, M. Wilkens and M. Lewenstein. The scheme assumes that players' strategies are unitary operations the players act on the maximally entangled two-qubit state. The aim of our paper is to identify some of non-classical features of the quantum scheme.
  arXiv  Detail & Related papers  (2020-12-12T22:41:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.