Nonlocality for Generic Networks.

Bell's theorem shows that correlations created by a single entangled quantum state cannot be reproduced classically. Such correlations are called nonlocal. They are the elementary manifestation of a broader phenomenon called network nonlocality, where several entangled states shared in a network create network nonlocal correlations. In this Letter, we provide the first class of strategies producing nonlocal correlations in generic networks. In these strategies, called color matching (CM), any source takes a color at random or in superposition, where the colors are labels for a basis of the associated Hilbert space. A party (besides other things) checks if the color of neighboring sources match. We show that in a large class of networks without input, well-chosen quantum CM strategies result in nonlocal correlations that cannot be produced classically. For our construction, we introduce the graph theoretical concept of rigidity of classical strategies in networks, and using the Finner inequality, establish a deep connection between network nonlocality and graph theory. In particular, we establish a link between CM strategies and the graph coloring problem. This work is extended in a longer paper [35M.-O. Renou, Phys. Rev. A 105, 022408 (2022)PLRAAN2469-992610.1103/PhysRevA.105.022408], where we introduce a second family of rigid strategies called token counting, leading to network nonlocality.

Genuine Quantum Nonlocality in the Triangle Network.

Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint statistics of fixed local measurement outputs. However, previous examples of this intriguing phenomenon all appear to stem directly from the usual form of quantum nonlocality, namely via the violation of a standard Bell inequality. Here we present novel examples of "quantum nonlocality without inputs," which we believe represent a new form of quantum nonlocality, genuine to networks. Our simplest examples, for the triangle network, involve both entangled states and joint entangled measurements. A generalization to any odd-cycle network is also presented.

Limits on Correlations in Networks for Quantum and No-Signaling Resources.

A quantum network consists of independent sources distributing entangled states to distant nodes which can then perform entangled measurements, thus establishing correlations across the entire network. But how strong can these correlations be? Here we address this question, by deriving bounds on possible quantum correlations in a given network. These bounds are nonlinear inequalities that depend only on the topology of the network. We discuss in detail the notably challenging case of the triangle network. Moreover, we conjecture that our bounds hold in general no-signaling theories. In particular, we prove that our inequalities for the triangle network hold when the sources are arbitrary no-signaling boxes which can be wired together. Finally, we discuss an application of our results for the device-independent characterization of the topology of a quantum network.