A Caltech Library Service

Entanglement of approximate quantum strategies in XOR games

Ostrev, Dimiter and Vidick, Thomas (2018) Entanglement of approximate quantum strategies in XOR games. Quantum Information and Computation, 18 (7-8). pp. 617-631. ISSN 1533-7146.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We show that for any ε > 0 there is an XOR game G = G(ε) with Θ(ε^(−1/5)) inputs for one player and Θ(ε^(−2/5)) inputs for the other player such that Ω(ε^(−1/5)) ebits are required for any strategy achieving bias that is at least a multiplicative factor (1−ε) 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 the scaling of our bound with ε is tight: for any XOR game there is an ε-optimal strategy using ⌈ε^(−1)⌉ ebits, irrespective of the number of questions in the game.

Item Type:Article
Related URLs:
URLURL TypeDescription Table of Contents Paper
Vidick, Thomas0000-0002-6405-365X
Additional Information:© 2018 Rinton Press. Research supported by NSF CAREER Grant CCF-1553477 and the IQIM, an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028).
Group:UNSPECIFIED, Institute for Quantum Information and Matter
Funding AgencyGrant Number
Institute for Quantum Information and Matter (IQIM)UNSPECIFIED
Gordon and Betty Moore FoundationGBMF-12500028
Issue or Number:7-8
Record Number:CaltechAUTHORS:20180926-101512002
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:89955
Deposited By: Tony Diaz
Deposited On:26 Sep 2018 17:27
Last Modified:04 Jun 2020 10:14

Repository Staff Only: item control page