Bounding Quantum-Classical Separations for Classes of Nonlocal Games

@inproceedings{Bannink2019BoundingQS,
  title={Bounding Quantum-Classical Separations for Classes of Nonlocal Games},
  author={T. Bannink and J. Bri{\"e}t and H. Buhrman and F. Labib and T. Lee},
  booktitle={STACS},
  year={2019}
}
We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which the classical bias goes down to $0$, for fixed $t$. Answering this question would have important consequences in the study of multi-party communication complexity, as a positive answer would imply an unbounded separation between randomized communication… Expand

References

SHOWING 1-10 OF 37 REFERENCES
Multipartite entanglement in XOR games
  • 18
  • PDF
Algorithms, Bounds, and Strategies for Entangled XOR Games
  • 6
  • PDF
Unique Games with Entangled Provers are Easy
  • 90
  • PDF
Consequences and limits of nonlocal strategies
  • 168
  • PDF
Quantum lower bounds by polynomials
  • 424
  • PDF
Exponential separation of quantum and classical communication complexity
  • R. Raz
  • Mathematics, Computer Science
  • STOC '99
  • 1999
  • 244
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
  • 74
  • PDF
...
1
2
3
4
...