Entanglement of approximate quantum strategies in XOR games

preprint2016arXivOpen access

Abstract

We show that for any ε>0\varepsilon>0 there is an XOR game G=G(ε)G=G(\varepsilon) with Θ(ε−1/5)Θ(\varepsilon^{-1/5}) inputs for one player and Θ(ε−2/5)Θ(\varepsilon^{-2/5}) inputs for the other player such that Ω(ε−1/5)Ω(\varepsilon^{-1/5}) ebits are required for any strategy achieving bias that is at least a multiplicative factor (1−ε)(1-\varepsilon) from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self-test for highly entangled states. Up to the exponent −1/5-1/5 the scaling of our bound with ε\varepsilon is tight: for any XOR game there is an ε\varepsilon-optimal strategy using ⌈ε−1⌉\lceil \varepsilon^{-1} \rceil ebits, irrespective of the number of questions in the game.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.