Guarantees on the structure of experimental quantum networks.

Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. In this work we demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.

Bell Inequalities with Overlapping Measurements.

Which nonlocal correlations can be obtained, when a party has access to more than one subsystem? While traditionally nonlocality deals with spacelike separated parties, this question becomes important with quantum technologies that connect devices by means of small shared systems. Here, we study Bell inequalities where measurements of different parties can have overlap. This allows us to accommodate problems in quantum information such as the existence of quantum error correction codes in the framework of nonlocality.

Experimental Full Network Nonlocality with Independent Sources and Strict Locality Constraints.

Nonlocality arising in networks composed of several independent sources gives rise to phenomena radically different from that in standard Bell scenarios. Over the years, the phenomenon of network nonlocality in the entanglement-swapping scenario has been well investigated and demonstrated. However, it is known that violations of the so-called bilocality inequality used in previous experimental demonstrations cannot be used to certify the nonclassicality of their sources.

Certification of non-classicality in all links of a photonic star network without assuming quantum mechanics.

Networks composed of independent sources of entangled particles that connect distant users are a rapidly developing quantum technology and an increasingly promising test-bed for fundamental physics. Here we address the certification of their post-classical properties through demonstrations of full network nonlocality. Full network nonlocality goes beyond standard nonlocality in networks by falsifying any model in which at least one source is classical, even if all the other sources are limited only by the no-signaling principle.

Proofs of Network Quantum Nonlocality in Continuous Families of Distributions.

The study of nonlocality in scenarios that depart from the bipartite Einstein-Podolsky-Rosen setup is allowing one to uncover many fundamental features of quantum mechanics. Recently, an approach to building network-local models based on machine learning led to the conjecture that the family of quantum triangle distributions of [Renou et al., Phys.

Full Network Nonlocality.

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.

Bell nonlocality in networks.

Bell's theorem proves that quantum theory is inconsistent with local physical models. It has propelled research in the foundations of quantum theory and quantum information science. As a fundamental feature of quantum theory, it impacts predictions far beyond the traditional scenario of the Einstein-Podolsky-Rosen paradox.

Genuine Network Multipartite Entanglement.

The standard definition of genuine multipartite entanglement stems from the need to assess the quantum control over an ever-growing number of quantum systems. We argue that this notion is easy to hack: in fact, a source capable of distributing bipartite entanglement can, by itself, generate genuine k-partite entangled states for any k. We propose an alternative definition for genuine multipartite entanglement, whereby a quantum state is genuinely network k-entangled if it cannot be produced by applying local trace-preserving maps over several (k-1)-partite states distributed among the parties, even with the aid of global shared randomness.

Bounding the Sets of Classical and Quantum Correlations in Networks.

We present a method that allows the study of classical and quantum correlations in networks with causally independent parties, such as the scenario underlying entanglement swapping. By imposing relaxations of factorization constraints in a form compatible with semidefinite programing, it enables the use of the Navascués-Pironio-Acín hierarchy in complex quantum networks. We first show how the technique successfully identifies correlations not attainable in the entanglement-swapping scenario.