Quantum advantage beyond entanglement in Bayesian game theory

• URL: http://arxiv.org/abs/2306.05090v1
• Date: Thu, 8 Jun 2023 10:49:40 GMT
• Title: Quantum advantage beyond entanglement in Bayesian game theory
• Authors: Adam Lowe
• Abstract summary: Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game. By writing the game explicitly as a Bayesian game, the resulting game is modified such the payoff's are different, and crucially restrictions are imposed on the measurements that Alice and Bob can perform. By imposing these restrictions, it is found that there exists quantum advantage beyond entanglement for a given quantum state. This is shown by decomposing the expected payoff into a classical and quantum term. Optimising over the expected payoff, results in the classical limit being surpassed. This gives an operational framework in order to witness and determine quantum discord.

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)
• 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)
• Quantumizing Classical Games: An Introduction to Quantum Game Theory [2.023315598404668]
  We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg. We formulate a protocol to $textitQuantumize$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators.
  arXiv  Detail & Related papers  (2023-04-30T02:14:09Z)
• 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)
• Quantum Extensive Form Games [0.0]
  We propose a concept of quantum extensive-form games, which is a quantum extension of classical extensive-form games. A quantum extensive-form game is also a generalization of quantum learning, including Quantum Generative Adrial Networks.
  arXiv  Detail & Related papers  (2022-07-12T09:58:21Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Playing quantum nonlocal games with six noisy qubits on the cloud [0.0]
  Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. We consider the minimal implementation of the nonlocal game proposed in Science 362, 308. We test this game by preparing a 6-qubit cluster state using quantum computers on the cloud by IBM, Ionq, and Honeywell.
  arXiv  Detail & Related papers  (2021-05-11T18:00:08Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.