Pseudo-telepathy games and genuine NS k-way nonlocality using graph states

Abstract

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 PR boxes. We extend this result proving that the probability distribution obtained by the Paley graph state on 13 vertices cannot be simulated by any number of 4-partite non local boxes and that the Paley graph states on more than $k^2{2}^{2k-2}$ vertices provides a probability distribution that cannot be simulated by k-partite nonlocal boxes

References in corpus (15)

• Persistent entanglement in arrays of interacting particles
• Multi-party entanglement in graph states
• Quantum Information and Relativity Theory
• Non-local correlations as an information theoretic resource
• The Communication Cost of Simulating Bell Correlations
• The definition of multipartite nonlocality
• Bell-type inequalities for partial separability in N-particle systems and quantum mechanical violations
• Popescu-Rohrlich correlations as a unit of nonlocality
• Quantum entanglement can be simulated without communication
• Quantifying the nonlocality of GHZ quantum correlations by a bounded communication simulation protocol
• Combinatorics and Quantum Nonlocality
• On the power of non-local boxes
• Nonlocality as an axiom for quantum theory
• New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
• On Weak Odd Domination and Graph-based Quantum Secret Sharing

Cited by in corpus (2)

• Ruling out Bipartite Nonsignaling Nonlocal Models for Tripartite Correlations
• Test to separate quantum theory from non-signaling theories