On the power of non-local boxes
Theoretical Computer Science
Recasting mermin's multi-player game into the framework of pseudo-telepathy
Quantum Information & Computation
Resources required for preparing graph states
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum degree up to local complementation: bounds and complexity
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We define a family of pseudo-telepathy games using graph states that extends the Mermin games. This family also contains a game used to define a quantum probability distribution that cannot be simulated by any number of nonlocal boxes. We extend this result, proving that the probability distribution obtained by the Paley graph state on 13 vertices (each vertex corresponds to a player) cannot be simulated by any number of 4-partite nonlocal boxes and that the Paley graph states on k222k-2 vertices provide a probability distribution that cannot be simulated by k-partite nonlocal boxes, for any k.