Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Near-Optimal and Explicit Bell Inequality Violations
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
The communication complexity of non-signaling distributions
Quantum Information & Computation
Multipartite entanglement in XOR games
Quantum Information & Computation
| Hi-index | 0.00 |
In a recent paper, Junge and Palazuelos presented two two-player games exhibiting interesting properties. In their first game, entangled players can perform notably better than classical players. The quantitative gap between the two cases is remarkably large, especially as a function of the number of inputs to the players. In their second game, entangled players can perform notably better than players that are restricted to using a maximally entangled state (of arbitrary dimension). This was the first game exhibiting such a behavior. The analysis of both games is heavily based on non-trivial results from Banach space theory and operator space theory. Here we provide alternative proofs of these two results. Our proofs are arguably simpler, use elementary probabilistic techniques and standard quantum information arguments, and also give better quantitative bounds.