Sharing nonlocality in a network using the quantum violation of chain network inequality

• URL: http://arxiv.org/abs/2311.04492v1
• Date: Wed, 8 Nov 2023 06:50:41 GMT
• Title: Sharing nonlocality in a network using the quantum violation of chain network inequality
• Authors: Rahul Kumar and A. K. Pan
• Abstract summary: 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.
• Score: 0.9948874862227255
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. Such a network features an arbitrary $n$ number of independent sources, $n$ edge parties, and a central party. Each party receives arbitrary $m$ inputs. We consider two different types of sharing of nonlocality in the network. i) The symmetric case - when the sharing of nonlocality is considered across all edge parties. ii) The asymmetric case - when the sharing of nonlocality is considered across only one edge party. For simplicity, we first consider the bilocal scenario $(n=2)$ with three inputs $m=3$ and demonstrate that while in the symmetric case at most two sequential observers can share nonlocality, in the asymmetric case at most four sequential observers can share nonlocality. We extend the study to $n$-local scenario by assuming each party receives three inputs and show that in the symmetric case the result remains the same for any $n$, but in the asymmetrical case, an unbounded number of sequential observers can share nonlocality across one edge for a sufficiently large value of $n$. We further extend our result for arbitrary $m$ input in $n$-local scenario. We demonstrate that for $m\geq 4$, in the symmetric case at most one sequential observer can share nonlocality irrespective of the value of $n$. For the asymmetric case, we analytically show that there exists $n(k)$ for which an arbitrary $k$ number of sequential observers can share the nonlocality across one edge. The optimal quantum violation of $m$-input $n$-local inequality is derived through an elegant SOS approach without specifying the dimension of the quantum system.

Related papers

• Nonlocal correlations in an asymmetric quantum network [0.0]
  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.
  arXiv  Detail & Related papers  (2023-11-08T10:27:32Z)
• Nonlocality under Computational Assumptions [51.020610614131186]
  A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
  arXiv  Detail & Related papers  (2023-03-03T16:53:30Z)
• 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)
• Network nonlocality sharing via weak measurements in the generalized star network configuration [5.203042650294495]
  Network nonlocality exhibits completely novel quantum correlations compared to standard quantum nonlocality. It can be shared in a generalized bilocal scenario via weak measurements.
  arXiv  Detail & Related papers  (2022-06-07T08:24:55Z)
• 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)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• 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)
• Locally Private Hypothesis Selection [96.06118559817057]
  We output a distribution from $mathcalQ$ whose total variation distance to $p$ is comparable to the best such distribution. We show that the constraint of local differential privacy incurs an exponential increase in cost. Our algorithms result in exponential improvements on the round complexity of previous methods.
  arXiv  Detail & Related papers  (2020-02-21T18:30:48Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.