Corpus ID: 10009338

On deciding the existence of perfect entangled strategies for nonlocal games

  title={On deciding the existence of perfect entangled strategies for nonlocal games},
  author={L. Mancinska and D. Roberson and A. Varvitsiotis},
  • L. Mancinska, D. Roberson, A. Varvitsiotis
  • Published 2016
  • Mathematics, Physics, Computer Science
  • ArXiv
  • First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via a polynomial-time Karp reduction, we show that independent set games are the hardest instances of this problem. Secondly, we show that if every independent set game whose entangled value is equal to one admits a perfect entangled strategy, then the same holds for all symmetric synchronous games. Finally, we identify… CONTINUE READING
    8 Citations
    Quantum and non-signalling graph isomorphisms
    • 41
    • PDF
    Linear conic formulations for two-party correlations and values of nonlocal games
    • 20
    • PDF
    Minimum Quantum Resources for Strong Non-Locality
    • 6
    • PDF
    An inertial upper bound for the quantum independence number of a graph
    • 1
    • PDF
    Spectral upper bound on the quantum k-independence number of a graph
    • PDF


    Unbounded entanglement in nonlocal games
    • 5
    • PDF
    Characterization of Binary Constraint System Games
    • 44
    • PDF
    Unique Games with Entangled Provers are Easy
    • J. Kempe, O. Regev, B. Toner
    • Physics, Computer Science
    • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
    • 2008
    • 89
    • PDF
    Extending and characterizing quantum magic games
    • 26
    • PDF
    Bell violations through independent bases games
    • O. Regev
    • Computer Science, Physics
    • Quantum Inf. Comput.
    • 2012
    • 30
    • PDF
    Consequences and limits of nonlocal strategies
    • 163
    • PDF
    Binary Constraint System Games and Locally Commutative Reductions
    • 40
    • PDF