# 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}
}
• T. Bannink, +2 authors T. Lee
• Published in STACS 2019
• Mathematics, Physics, Computer Science
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
• Computer Science, Mathematics
• Quantum Inf. Comput.
• 2013
• 18
• PDF
Algorithms, Bounds, and Strategies for Entangled XOR Games
• Computer Science, Mathematics
• ITCS
• 2019
• 6
• PDF
Unique Games with Entangled Provers are Easy
• Mathematics, Physics
• 2008 49th Annual IEEE Symposium on Foundations of Computer Science
• 2008
• 90
• PDF
Consequences and limits of nonlocal strategies
• Computer Science, Physics
• Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
• 2004
• 168
• PDF
Quantum lower bounds by polynomials
• Mathematics, Computer Science
• JACM
• 2001
• 424
• PDF
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
• Computer Science
• Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
• 2007
• 74
• PDF