Nonlocal correlations in an asymmetric quantum network

• URL: http://arxiv.org/abs/2311.04583v1
• Date: Wed, 8 Nov 2023 10:27:32 GMT
• Title: Nonlocal correlations in an asymmetric quantum network
• Authors: Souradeep Sasmal, Shyam Sundar Mahato, and Alok Kumar Pan
• Abstract summary: We introduce variants of asymmetric bilocal as well as trilocal network scenarios. We derive two variants of asymmetric bilocality inequalities and demonstrate their optimal quantum violations. We use an elegant sum-of-squares technique that enables us to evaluate the quantum optimal values of the proposed network inequalities.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: The nonlocality revealed in a multiparty multisource network Bell experiment is conceptually different than the standard multiparty Bell nonlocality involving a single common source. Here, by introducing variants of asymmetric bilocal as well as trilocal network scenarios, we go beyond the typical bilocal network scenario where both the edge parties have an equal number of measurement settings. We first introduce an asymmetric bilocal network where one of the edge parties (say, Alice) receives $2^{n-1}$ inputs and the other edge party (say, Charlie) receives $n$ inputs. We derive two variants of asymmetric bilocality inequalities and demonstrate their optimal quantum violations. Further, we explore two types of asymmetric trilocal scenarios: (i) when two edge parties receive $2^{n-1}$ inputs each and the other edge party receives $n$ inputs, and (ii) when one edge party receives $2^{n-1}$ inputs, and the other two edge parties have $n$ inputs each. We use an elegant sum-of-squares technique that enables us to evaluate the quantum optimal values of the proposed network inequalities without assuming the dimension of the systems for both the asymmetric bilocal as well as the trilocal scenarios. Further, we demonstrate the robustness of the quantum violations of the proposed inequalities in the presence of white noise.

Related papers

• Collaborative non-parametric two-sample testing [55.98760097296213]
  The goal is to identify nodes where the null hypothesis $p_v = q_v$ should be rejected. We propose the non-parametric collaborative two-sample testing (CTST) framework that efficiently leverages the graph structure. Our methodology integrates elements from f-divergence estimation, Kernel Methods, and Multitask Learning.
  arXiv  Detail & Related papers  (2024-02-08T14:43:56Z)
• Sharing nonlocality in a network using the quantum violation of chain network inequality [0.9948874862227255]
  Based on the quantum violation of suitable $n$-local inequality in a star network for arbitrary $m$ inputs, we demonstrate the sharing of nonlocality in the network. We consider two different types of sharing of nonlocality in the network.
  arXiv  Detail & Related papers  (2023-11-08T06:50:41Z)
• Generalized $n$-locality inequalities in linear-chain network for arbitrary inputs scenario and their quantum violations [1.3452510519858996]
  Multipartite nonlocality in a network is conceptually different from standard multipartite Bell nonlocality. We derive a family of generalized $n$-locality inequalities for a linear-chain network for arbitrary $n$. We show that the optimal quantum violation requires the observables of edge parties to mutually anticommuting.
  arXiv  Detail & Related papers  (2022-12-29T14:43:28Z)
• Sharing nonlocality in quantum network by unbounded sequential observers [0.0]
  We explore the sequential sharing of nonlocality in a quantum network. We show that even for an arbitrary $m$ input scenario, the nonlocality can be shared by an unbounded number of sequential observers.
  arXiv  Detail & Related papers  (2022-12-29T14:41:27Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Generalized $n$-locality inequalities in star-network configuration and their optimal quantum violations [0.0]
  We propose a non-trivial generalization of $n$-locality scenario in star-network configuration. We derive a family of generalized $n$-locality inequalities for any arbitrary $m$. We argue that for $m>3$, a single copy of a two-qubit entangled state may not be enough to exhibit the violation of $n$-locality inequality.
  arXiv  Detail & Related papers  (2021-12-29T15:13:43Z)
• 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)
• Distributed Saddle-Point Problems Under Similarity [173.19083235638104]
  We show that a given suboptimality $epsilon0$ is achieved master/workers networks in $Omegabig. We then propose algorithms matching the lower bounds either types of networks (up to log-overs) We assess effectiveness of the proposed algorithms on a robust logistic regression problem.
  arXiv  Detail & Related papers  (2021-07-22T14:25:16Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Learning Halfspaces with Tsybakov Noise [50.659479930171585]
  We study the learnability of halfspaces in the presence of Tsybakov noise. We give an algorithm that achieves misclassification error $epsilon$ with respect to the true halfspace.
  arXiv  Detail & Related papers  (2020-06-11T14:25: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.