Classification of no-signaling correlations and the guess your neighbor's input game

• Published in: arXiv.org
• Main Authors: He-Ming, Wang, Heng-Yun, Zhou, Liang-Zhu, Mu, Fan, Heng
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 11.09.2014
• Subjects: Correlation analysis; Optical communication; Optimization; Orthogonality; Physics - Quantum Physics; Quantum mechanics; Quantum theory; Signal classification; Signaling
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1312.4648

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.