Verifying full quantum network nonlocality in arbitrary configurations by nonlinear Bell-like inequalities

• URL: http://arxiv.org/abs/2608.10972v1
• Date: Tue, 11 Aug 2026 14:30:26 GMT
• Title: Verifying full quantum network nonlocality in arbitrary configurations by nonlinear Bell-like inequalities
• Abstract summary: Full quantum network nonlocality (FQNN) describes a scenario where all sources in a network are nonlocal.<n>We propose a method that certifies FQNN in general quantum networks using only a single Bell-like inequality.
• Score: 10.352284845761561
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Full quantum network nonlocality (FQNN) describes a scenario where all sources in a network are nonlocal. Existing criteria of FQNN can only be verified in star networks by violating a single Bell-like inequality. Here we propose a method that certifies FQNN in general quantum networks using only a single Bell-like inequality. We show that the topological obstacle to one-shot detection can be overcome by expanding the original network with a carefully chosen number of auxiliary local sources and parties. The correlations of the enlarged network are then tested with a single inequality; a violation implies that all original sources must be nonlocal. Our approach provides an efficient, experimentally friendly way to verify FQNN in any network topology.

Related papers

• Measurement Geometry as a Resource for Certifying Network Nonlocality [0.0]
  Quantum networks can exhibit nonclassical correlations that cannot be explained by classical models with independent sources.<n>We develop an operational framework for certifying network nonlocality in the bilocal Alice--Bob--Charlie network.<n>Results identify measurement geometry as an independent resource for network nonlocality and provide a practical route toward its certification on programmable quantum processors.
  arXiv  Detail & Related papers  (2026-07-06T04:25:04Z)
• Linear Program Witness for Network Nonlocality in Arbitrary Networks [0.0]
  Network nonlocality extends to settings with multiple independent sources and parties.<n>We introduce a witness for network nonlocality built from five linear constraints.<n>These classes are network-agnostic, although the explicit forms of the constraints must be tailored to a network's structure.
  arXiv  Detail & Related papers  (2025-12-26T10:15:27Z)
• Witnessing nonlocality in quantum network of continuous-variable systems by generalized quasiprobability functions [0.0]
  We first propose a kind of nonlinear Bell-type inequality that is applicable to quantum networks of both finite or infinite dimensional systems.<n>We show that this approach works well for witnessing the nonlocality in networks of continuous-variable (CV) systems.
  arXiv  Detail & Related papers  (2025-07-11T01:42:44Z)
• 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)
• Device-independent full network nonlocality for arbitrary-party and unbounded-input scenario [0.0]
  Full network nonlocality (FNN) characterizes quantum correlations that cannot be reproduced by a local-nonlocal model. We introduce an elegant set of arbitrary-party and unbounded-input network inequalities in star-shaped and linear-chain networks. Our derivation of optimal quantum violation is fully analytic and devoid of assuming the dimension of the quantum system.
  arXiv  Detail & Related papers  (2024-09-28T17:40:34Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• Experimental full network nonlocality with independent sources and strict locality constraints [59.541438315564854]
  Nonlocality in networks gives rise to phenomena radically different from that in standard Bell scenarios. We experimentally observe full network nonlocality in a network where the source-independence, locality, and measurement-independence loopholes are closed. Our experiment violates known inequalities characterizing non-full network nonlocal correlations by over five standard deviations.
  arXiv  Detail & Related papers  (2023-02-05T20:03:58Z)
• Certification of non-classicality in all links of a photonic star network without assuming quantum mechanics [52.95080735625503]
  Full network nonlocality goes beyond standard nonlocality in networks by falsifying any model in which at least one source is classical. We report on the observation of full network nonlocality in a star-shaped network featuring three independent sources of photonic qubits and joint three-qubit entanglement-swapping measurements.
  arXiv  Detail & Related papers  (2022-12-19T19:00:01Z)
• 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)
• Proving the Lottery Ticket Hypothesis: Pruning is All You Need [56.25432563818297]
  The lottery ticket hypothesis states that a randomly-d network contains a small subnetwork such that, when trained in isolation, can compete with the performance of the original network. We prove an even stronger hypothesis, showing that for every bounded distribution and every target network with bounded weights, a sufficiently over- parameterized neural network with random weights contains a subnetwork with roughly the same accuracy as the target network, without any further training.
  arXiv  Detail & Related papers  (2020-02-03T07:23:11Z)

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.