Linear Program Witness for Network Nonlocality in Arbitrary Networks
- URL: http://arxiv.org/abs/2512.21962v1
- Date: Fri, 26 Dec 2025 10:15:27 GMT
- Title: Linear Program Witness for Network Nonlocality in Arbitrary Networks
- Authors: Salome Hayes-Shuptar, Daniel Bhatti, Ana Belen Sainz, David Elkouss,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Network nonlocality extends Bell nonlocality to settings with multiple independent sources and parties. Certifying it in quantum information processing tasks requires suitable witnesses. However, in contrast to local correlations, the set of network-local correlations is non-convex. This non-convexity makes certifying network nonlocality a highly non-trivial task. Existing approaches involve leveraging network-specific properties, or inflation-based methods whose constraints grow combinatorially in the number of local variables. In this work, we introduce a linear programming witness for network nonlocality built from five classes of linear constraints. These classes are network-agnostic, although the explicit forms of the constraints must be tailored to a specific network's structure. We use the procedure to construct network nonlocality witnesses for a family of ring networks and certify network nonlocality for a concrete example, relying only on observed probabilities and a tunable experimental parameter. Our work advances the search for efficient witnesses to certify network nonlocality across diverse quantum network architectures.
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) - Verification of Neural Networks Local Differential Classification
Privacy [1.3024517678456733]
We propose a new privacy property, called local differential classification privacy (LDCP)
LDCP extends local robustness to a differential privacy setting suitable for black-box classifiers.
We propose Sphynx, an algorithm that computes an abstraction of all networks, with a high probability, from a small set of networks.
arXiv Detail & Related papers (2023-10-31T09:11:12Z) - 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) - Possibilistic approach to network nonlocality [0.0]
We explore a possibilistic approach, where only patterns of possible outcomes matter, and apply it to Bell nonlocality in networks with independent sources.
We present various algorithms for determining whether a given outcome pattern can be achieved via classical resources or via non-signaling resources.
We show how to construct certificates for detecting the nonlocality of a certain pattern, in the form of nonlinear Bell-type inequalities involving joint probabilities.
arXiv Detail & Related papers (2022-08-29T12:04:25Z) - Experimental demonstration of full network nonlocality in the bilocal
scenario [0.0]
We experimentally demonstrate full network nonlocal correlations in a network.
Our results may pave the way for the use of nonlocality test in quantum communication protocols.
arXiv Detail & Related papers (2022-01-17T11:49:26Z) - 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) - Enabling certification of verification-agnostic networks via
memory-efficient semidefinite programming [97.40955121478716]
We propose a first-order dual SDP algorithm that requires memory only linear in the total number of network activations.
We significantly improve L-inf verified robust accuracy from 1% to 88% and 6% to 40% respectively.
We also demonstrate tight verification of a quadratic stability specification for the decoder of a variational autoencoder.
arXiv Detail & Related papers (2020-10-22T12:32:29Z)
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.