Witnessing nonlocality in quantum network of continuous-variable systems by generalized quasiprobability functions

• URL: http://arxiv.org/abs/2507.08252v2
• Date: Thu, 17 Jul 2025 13:52:55 GMT
• Title: Witnessing nonlocality in quantum network of continuous-variable systems by generalized quasiprobability functions
• Authors: Taotao Yan, Jinchuan Hou, Xiaofei Qi, Kan He,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gaussian measurements can not be used to witness nonlocality in Gaussian states as well as the network nonlocality in networks of continuous-variable (CV) systems. Thus special non-Gaussian measurements have to be utilized. In the present paper, we first propose a kind of nonlinear Bell-type inequality that is applicable to quantum networks of both finite or infinite dimensional systems. Violation of the inequality will witness the network nonlocality. This inequality allows us to propose a method of the supremum strategy for detecting network nonlocality in CV systems with source states being any multipartite multi-mode Gaussian states according to the configurations of the networks by utilizing non-Gaussian measurements based on generalized quasiprobability functions. The nonlinear Bell-type inequalities for CV networks, which depend solely on the generalized quasiprobability functions of Gaussian states, are straightforward to construct and implement. As illustrations, we propose the corresponding nonlinear Bell-type inequalities for any chain, star, tree-shaped and cyclic networks in CV systems with source states being $(1+1)$-mode Gaussian states. The examples show that this approach works well for witnessing the nonlocality in networks of CV systems. Particularly, a thorough discussion is given for the entanglement swapping network. Our study provide a strong signature for the network nonlocality nature of CV systems and lead to precise recipes for its experimental verification.

Related papers

• Network nonlocality with continuous variables: probing nonbilocality through pseudospin measurements [0.0]
  Quantum networks offer a compelling platform for probing nonlocal correlations beyond the Bell scenario.<n>We study the bilocal scenario, the simplest quantum network, in a continuous-variable (CV) framework using pseudospin measurements.<n>Our findings underscore the potential of CV systems for realizing network-based quantum correlations.
  arXiv  Detail & Related papers  (2025-06-09T18:31:17Z)
• Local models and Bell inequalities for the minimal triangle network [84.67234803583032]
  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 new 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)
• Approximation with Random Shallow ReLU Networks with Applications to Model Reference Adaptive Control [0.0]
  We show that ReLU networks with randomly generated weights and biases achieve $L_infty$ error of $O(m-1/2)$ with high probability. We show how the result can be used to get approximations of required accuracy in a model reference adaptive control application.
  arXiv  Detail & Related papers  (2024-03-25T19:39:17Z)
• Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy [52.40331776572531]
  We show that learning depth-$3$ ReLU networks under the Gaussian input distribution is hard even in the smoothed-analysis framework. Our results are under a well-studied assumption on the existence of local pseudorandom generators.
  arXiv  Detail & Related papers  (2023-02-15T02:00:26Z)
• 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)
• On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias [50.84569563188485]
  We show that gradient flow converges in direction when labels are determined by the sign of a target network with $r$ neurons. Our result may already hold for mild over- parameterization, where the width is $tildemathcalO(r)$ and independent of the sample size.
  arXiv  Detail & Related papers  (2022-05-18T16:57:10Z)
• Characterizing nonlocal correlations through various $n$-locality inequlities in quantum network [0.0]
  Multipartite quantum networks feature multiple independent sources. Network nonlocality has been explored when each source produces a two-qubit entangled state. We propose a new set of $n$-locality inequalities in star-network configuration.
  arXiv  Detail & Related papers  (2021-12-29T14:44:09Z)
• The Separation Capacity of Random Neural Networks [78.25060223808936]
  We show that a sufficiently large two-layer ReLU-network with standard Gaussian weights and uniformly distributed biases can solve this problem with high probability. We quantify the relevant structure of the data in terms of a novel notion of mutual complexity.
  arXiv  Detail & Related papers  (2021-07-31T10:25:26Z)
• Predicting Unreliable Predictions by Shattering a Neural Network [145.3823991041987]
  Piecewise linear neural networks can be split into subfunctions. Subfunctions have their own activation pattern, domain, and empirical error. Empirical error for the full network can be written as an expectation over subfunctions.
  arXiv  Detail & Related papers  (2021-06-15T18:34:41Z)
• 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)

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.