Classification of no-signaling correlation and the “guess your neighbor's input” game

Abstract

We formulate a series of non-trivial equalities which are satisfied by all no-signaling correlations, meaning that no faster-than-light communication is allowed with the resource of these correlations. All quantum and classical correlations satisfy these equalities since they are no-signaling. By applying these equalities, we provide a general framework for solving the multipartite "guess your neighbor's input" (GYNI) game, which is naturally no-signaling but shows conversely that general no-signaling correlations are actually more non-local than those allowed by quantum mechanics. We confirm the validity of our method for number of players from 3 up to 19, thus providing convincing evidence that it works for the general case. In addition, we solve analytically the tripartite GYNI and obtain a computable measure of supra-quantum correlations. This result simplifies the defined optimization procedure to an analytic formula, thus characterizing explicitly the boundary between quantum and supra-quantum correlations. In addition, we show that the gap between quantum and no-signaling boundaries containing supra-quantum correlations can be closed by local orthogonality conditions in the tripartite case. Our results provide a computable classification of no-signaling correlations.

A nonlocal game for witnessing quantum networks

“…The new result is also useful for nonlocal satisfiability problems going beyond CHSH game [3] and cubic game [36]. The graphic game finally extends the guessing your neighbor's input (GYNI) game [48,49]. The present model provides novel instances to feature nonlocal games with different performances [50].…”