The minimal example of quantum network Bell nonlocality

• URL: http://arxiv.org/abs/2605.00981v1
• Date: Fri, 01 May 2026 18:00:00 GMT
• Title: The minimal example of quantum network Bell nonlocality
• Abstract summary: We show that quantum nonlocality is possible in the triangle network where the parties have no input choices and produce only binary-valued outcomes.<n>We develop an efficient method for parameterizing quantum distributions in networks, inspired by the formalism of higher-order quantum operations.
• Score: 35.32674634043692
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, the study of Bell nonlocality has been generalized to quantum networks, where multiple independent sources distribute physical systems to distant parties who perform local measurements. In this context, a central open question is to identify the minimal network configuration in which quantum resources produce Bell nonlocal correlations. Here we address this question and show that quantum nonlocality is possible in the triangle network where the parties have no input choices and produce only binary-valued outcomes. To do so, we start by identifying a family of target distributions and proving their nonlocality. Next, we construct an explicit quantum model that reproduces the target distributions to machine precision. For this, we develop an efficient method for parameterizing quantum distributions in networks, inspired by the formalism of higher-order quantum operations. When considering the number of observed variables and their cardinality, this constitutes the smallest scenario possible that supports quantum nonlocality in networks. Moreover, by analyzing the explicit quantum model, we obtain new insights into how nonlocal distributions can be generated in quantum networks.

Related papers

• Local models and Bell inequalities for the minimal triangle network [78.45663456116702]
  Nonlocal correlations enable surprising phenomena in quantum information and quantum foundations.<n>We study one of the simplest scenarios, namely that of distributions invariant under permutations of parties in the minimal triangle network.<n>We provide insights on the existence of a classical-quantum gap in the triangle network with binary outcomes.
  arXiv  Detail & Related papers  (2025-03-20T19:11:06Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  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. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Towards a minimal example of quantum nonlocality without inputs [0.41942958779358674]
  In the network scenario, it is possible to demonstrate quantum nonlocality without the need for measurements inputs. We present examples involving output cardinalities of $3-3-3$ and $3-3-2$.
  arXiv  Detail & Related papers  (2022-07-18T11:50:56Z)
• Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
  We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof. We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
  arXiv  Detail & Related papers  (2022-03-30T18:00:00Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Genuine network quantum nonlocality and self-testing [0.0]
  We define a notion of genuine network quantum nonlocality. We show several examples of correlations that are genuine network nonlocal. In particular, we present an example of quantum self-testing which relies on the network structure.
  arXiv  Detail & Related papers  (2021-05-26T06:05:22Z)
• Full network nonlocality [68.8204255655161]
  We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources. We show that the most well-known network Bell test does not witness full network nonlocality. More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Exploring Bell nonlocality of quantum networks with stabilizing and logical operators [0.0]
  Knowing the stabilizing and logical operators indeed provides a new way of exploring Bell non-locality in quantum networks. For the qubit distribution in quantum networks, the associated nonlinear Bell inequalities are derived. The tilted nonlinear Bell inequalities tailored for specific non-maximal entangled stabilizer states are also explored.
  arXiv  Detail & Related papers  (2021-05-09T05:13:41Z)
• Maximal qubit violation of n-local inequalities in quantum network [0.0]
  Source independent quantum networks are considered as a natural generalization to the Bell scenario. We consider the complexities in the quantum networks with an arbitrary number of parties distributed in chain-shaped and star-shaped networks.
  arXiv  Detail & Related papers  (2020-11-06T18:45:07Z)
• Characterizing Quantum Correlations In Fixed Input $n$-Local Network Scenario [0.0]
  Quantum nonlocality can be exploited even when all the parties do not have freedom to select inputs randomly. One can utilize such a feature of quantum networks for purpose of entanglement detection of bipartite quantum states.
  arXiv  Detail & Related papers  (2020-04-17T13:19:50Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.