Abstract Nonlocal game as a witness of the nonlocality of entanglement is of fundamental importance in various fields. The well-known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks consisting of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We propose an efficient method to construct multipartite nonlocal games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providing a simple sufficient and necessary condition. The graphic games imply a linear Bell testing of the nonlocality of general quantum networks consisting of EPR states. It also allows generating new instances going beyond CHSH game. These results have interesting applications in quantum networks, Bell theory, computational complexity, and theoretical computer science.
Abstract Nonlocal game as a witness of the nonlocality of entanglement is of fundamental importance in various fields. The well-known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks consisting of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We propose an efficient method to construct multipartite nonlocal games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providing a simple sufficient and necessary condition. The graphic games imply a linear Bell testing of the nonlocality of general quantum networks consisting of EPR states. It also allows generating new instances going beyond CHSH game. These results have interesting applications in quantum networks, Bell theory, computational complexity, and theoretical computer science.
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. In this work, we develop this perspective by connecting the Bell-locality framework to several complementary mathematical representations of nonlocal games and quantum strategies. We begin with local hidden-variable models, the CHSH inequality, and the role of Bell nonlocality as a device-independent witness of entanglement, and then introduce nonlocal games through the standard predicate/verifier formalism.
We next examine a set of representative examples, including XOR games, the GHZ game, graph-based coloring games, the Mermin-Peres magic square game, and Hardy's paradox as a related logical manifestation of nonlocality. Building on this foundation, we compare four closely related representation frameworks: conditional-probability and correlation descriptions, Bell-functional formulations, entangled-value optimization, and the quantum-operator approach together with the Navascues-Pironio-Acin (NPA) hierarchy. These viewpoints are then instantiated for the CHSH, magic square, and GHZ games, showing how each representation emphasizes a different aspect of the same underlying task.
Taken together, these examples show that nonlocal games can be studied simultaneously as geometric objects in correlation space, optimization problems over entangled resources, and operator-theoretic constructions. This multi-representation viewpoint clarifies the relation between Bell inequality violations, perfect quantum strategies, pseudo-telepathy, and semidefinite relaxations of quantum correlations.
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. This review connects the Bell-locality framework to several complementary mathematical representations of nonlocal games and quantum strategies. We begin with local hidden-variable models, the CHSH inequality, and the role of Bell nonlocality as a device-independent witness of entanglement. We then introduce nonlocal games through the standard predicate/verifier formalism and discuss representative examples, including XOR games, the GHZgame, graph-based colouring games, the Mermin–Peres magic square game, and Hardy’s paradox as a related logical manifestation of nonlocality. The central contribution of the article is a comparative organisation of four closely related representation frameworks: conditional-probability andcorrelation descriptions, Bell-functional formulations, entangled-value optimisation, and the quantum-operator approach together with the Navascu´es–Pironio–Ac´ın hierarchy. These viewpoints are instantiated for the CHSH, magic square, and GHZ games, showing how each representation emphasises a different aspect of the same underlying task. The resulting synthesis clarifies the relation between Bell inequality violations, perfect quantum strategies, pseudo-telepathy, and semidefinite relaxations of quantum correlations.
The multipartite correlations derived from local measurements on some composite quantum systems are inconsistent with those reproduced classically. This inconsistency is known as the quantum nonlocality and shows a milestone in the foundations of quantum theory. Still, it is NP hard to decide a nonlocal quantum state. We investigate an extended question as to how to characterize the nonlocal properties of quantum states that are distributed and measured in networks. We first prove the generic tripartite nonlocality of chain-shaped quantum networks using semiquantum nonlocal games. We then introduce an approach to prove the generic activated nonlocality as a result of entanglement swapping for all the bipartite entangled states. The result is further applied to show the multipartite nonlocality and activated nonlocality for all the nontrivial quantum networks consisting of any entangled states. Our results provide the nonlocality witnesses and quantum superiorities of all the connected quantum networks or nontrivial hybrid networks in contrast to classical networks.
Departing from the usual paradigm of local operations and classical communication adopted in entanglement theory, here we study the interconversion of quantum states by means of local operations and shared randomness. A set of necessary and sufficient conditions for the existence of such a transformation between two given quantum states is given in terms of the payoff they yield in a suitable class of nonlocal games. It is shown that, as a consequence of our result, such a class of nonlocal games is able to witness quantum entanglement, however weak, and reveal nonlocality in any entangled quantum state. An example illustrating this fact is provided.
Networks have advanced the study of nonlocality beyond Bell's theorem. Here, we introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources. Showcasing that this notion is stronger than standard network nonlocality, we prove that the most well-known network Bell test does not witness full network nonlocality. In contrast, we demonstrate that its generalization to star networks is capable of detecting full network nonlocality in quantum theory. More generally, we point out that established methods for analyzing local and theory-independent correlations in networks can be combined in order to systematically deduce sufficient conditions for full network nonlocality in any network and input-output scenario. We demonstrate the usefulness of these methods by constructing polynomial witnesses of full network nonlocality for the bilocal scenario. Then, we show that these inequalities can be violated via quantum elegant joint measurements.
Nonlocal games offer a conceptually clear way to reason about Bell nonlocality. However, we show that as originally defined, and most commonly used, i.e. with a deterministic predicate, they cannot be complete witnesses of nonlocality. Concretely, we prove the existence of nonlocal behaviours which do not violate any such nonlocal game. Furthermore, we also show that quantum mechanics can produce these game-classical nonlocal behaviours. We prove that this phenomenon exists in every bipartite scenario (X,Y,A,B) with X,Y≥2 and A,B≥4.