Related papers: On the power of quantum entanglement in multipartite quantum XOR games

On the power of quantum entanglement in multipartite quantum XOR games

URL: http://arxiv.org/abs/2302.11800v1
Date: Thu, 23 Feb 2023 06:26:37 GMT
Title: On the power of quantum entanglement in multipartite quantum XOR games
Authors: Marius Junge, Carlos Palazuelos
Abstract summary: In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.
Score: 3.655021726150368
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: In this paper we show that, given $k\geq 3$, there exist $k$-player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.

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)
Decidability of fully quantum nonlocal games with noisy maximally entangled states [5.076419064097734]
This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. We prove that there is a computable upper bound on the copies of noisy maximally entangled states for the players to win a fully quantum nonlocal game with a probability arbitrarily close to the quantum value.
arXiv Detail & Related papers (2022-11-19T08:11:02Z)
Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
arXiv Detail & Related papers (2022-08-22T08:31:46Z)
On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games [65.51757376525798]
We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
arXiv Detail & Related papers (2021-12-09T21:06:52Z)
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)
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)
Noisy three-player dilemma game: Robustness of the quantum advantage [0.0]
We analyze the persistence of the quantum advantage under corruption of the input states. We find that the classical strategy will always outperform the quantum strategy if corruption is higher than half.
arXiv Detail & Related papers (2020-04-09T13:34:33Z)

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