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.
The unified method for abundant soliton solutions of local time fractional nonlinear evolution equations