Photonic implementation of the quantum Morra game
- URL: http://arxiv.org/abs/2311.08495v3
- Date: Thu, 11 Jul 2024 13:35:38 GMT
- Title: Photonic implementation of the quantum Morra game
- Authors: Andres Ulibarrena, Alejandro Sopena, Russell Brooks, Daniel Centeno, Joseph Ho, German Sierra, Alessandro Fedrizzi,
- Abstract summary: 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.
- Score: 69.65384453064829
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, 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. A Nash equilibrium can be found in some cases by employing a pure strategy, which is impossible in the classical game where a mixed strategy is always required. We prepared our states using photonic qubits on a linear optics setup, with an average deviation less than 2% with respect to the measured outcome probabilities. Finally, we discuss potential applications of the quantum Morra game to the study of quantum information and communication.
Related papers
- 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) - 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) - Implementing 2-qubit pseudo-telepathy games on noisy intermediate scale
quantum computers [0.0]
Mermin-Peres like proofs of quantum contextuality can furnish non-local games with a guaranteed quantum strategy.
We show that the quantumness of these games are almost revealed when we play them on the IBM Quantum Experience.
arXiv Detail & Related papers (2023-10-11T12:47:12Z) - 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) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Quantum guessing games with posterior information [68.8204255655161]
A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial information after a quantum measurement has been performed.
We formalize symmetry of guessing games and characterize the optimal measurements in cases where the symmetry is related to an irreducible representation.
arXiv Detail & Related papers (2021-07-25T19:10:26Z) - Surpassing the Classical Limit in Magic Square Game with Distant Quantum
Dots Coupled to Optical Cavities [0.0]
We propose an experimental setup for quantum computation with quantum dots inside optical cavities.
Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology.
We show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness and increase his winning probability.
arXiv Detail & Related papers (2020-11-03T05:45:06Z) - Quantum version of a generalized Monty Hall game and its possible
applications to quantum secure communications [0.0]
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.
arXiv Detail & Related papers (2020-10-26T17:57:12Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z) - Quantum Go Machine [15.33065067850941]
We experimentally demonstrate a quantum version of Go using correlated photon pairs entangled in polarization degree of freedom.
Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones.
Our results establish a paradigm of inventing new games with quantum-enabled difficulties.
arXiv Detail & Related papers (2020-07-23T18:00:01Z)
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.