Genuinely nonlocal sets without entanglement in multipartite systems

• URL: http://arxiv.org/abs/2408.11566v1
• Date: Wed, 21 Aug 2024 12:18:33 GMT
• Title: Genuinely nonlocal sets without entanglement in multipartite systems
• Authors: Ying-Ying Lu, Hai-Qing Cao, Hui-Juan Zuo, Shao-Ming Fei,
• Abstract summary: A set of multipartite states is genuinely nonlocal if it is locally indistinguishable in every bipartition of the subsystems. If the set is locally reducible, we say it has genuine nonlocality of type uppercaseexpandafterromannumeral 1. Otherwise, we say it has genuine nonlocality of type uppercaseexpandafterromannumeral 2.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A set of multipartite orthogonal states is genuinely nonlocal if it is locally indistinguishable in every bipartition of the subsystems. If the set is locally reducible, we say it has genuine nonlocality of type \uppercase\expandafter{\romannumeral 1}. Otherwise, we say it has genuine nonlocality of type \uppercase\expandafter{\romannumeral 2}. Due to the complexity of the problem, the construction of genuinely nonlocal sets in general multipartite systems has not been completely solved so far. In this paper, we first provide a nonlocal set of product states in bipartite systems. We obtain a genuinely nonlocal set of type~\uppercase\expandafter{\romannumeral 1} without entanglement in general $n$-partite systems $\otimes^{n}_{i=1}\mathbb{C}^{d_{i}}$ $[3\leq (d_{1}-1)\leq d_{2}\leq \cdots\leq d_{n},n\geq3]$. Then we present two constructions with genuine nonlocality of type~\uppercase\expandafter{\romannumeral 2} in $\mathbb{C}^{d_{1}}\otimes\mathbb{C}^{d_{2}}\otimes\mathbb{C}^{d_{3}}$ $(3\leq d_{1}\leq d_{2}\leq d_{3})$ and $\otimes^{n}_{i=1}\mathbb{C}^{d_{i}}$ $(3\leq d_{1}\leq d_{2}\leq \cdots\leq d_{n},n\geq4)$. Our results further positively answer the open problem that there does exist a genuinely nonlocal set of type~\uppercase\expandafter{\romannumeral2} in multipartite systems [M. S. Li, Y. L. Wang, F. Shi, and M. H. Yung, J. Phys. A: Math. Theor. 54, 445301 (2021)] and highlight its related applications in quantum information processing.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Strongest nonlocal sets with minimum cardinality in multipartite systems [4.2270183742578835]
  Quantum nonlocality is the strongest form of quantum nonlocality recently presented in multipartite quantum systems. We find a construction of strongest nonlocal sets in $mathbbCd_1otimes mathbbCd_2otimes mathbbCdotimes mathbbCdotimes mathbbCdotimes mathbbCdotimes mathbbCdotimes mathbbCd
  arXiv  Detail & Related papers  (2024-08-06T01:56:04Z)
• Strongest nonlocal sets with minimum cardinality in tripartite systems [0.0]
  We construct the strongest nonlocal set of size $d2+1 in $mathbbCdotimes mathbbCd$.
  arXiv  Detail & Related papers  (2024-05-24T07:37:50Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• Locally stable sets with minimum cardinality [0.0]
  Li and Wang arXiv:2202.09034 proposed the concept of a locally stable set. We focus on the constructions of locally stable sets in multipartite quantum systems.
  arXiv  Detail & Related papers  (2023-07-17T09:00:12Z)
• Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
  We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$. We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
  arXiv  Detail & Related papers  (2023-05-22T06:58:16Z)
• Enlarging the notion of additivity of resource quantifiers [62.997667081978825]
  Given a quantum state $varrho$ and a quantifier $cal E(varrho), it is a hard task to determine $cal E(varrhootimes N)$. We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.
  arXiv  Detail & Related papers  (2022-07-31T00:23:10Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Nonlocal sets of orthogonal multipartite product states with less members [0.0]
  We study the constructions of nonlocal product states in multipartite systems that cannot be distinguished by local operations and classical communication. Remarkably, our sets contain less nonlocal product states than the existing ones, which improves the recent results and highlights their related applications in quantum information processing.
  arXiv  Detail & Related papers  (2021-11-18T16:05:31Z)
• On the state space structure of tripartite quantum systems [0.22741525908374005]
  It has been shown that the set of states separable across all the three bipartitions [say $mathcalBint(ABC)$] is a strict subset of the set of states having positive partial transposition (PPT) across the three bipartite cuts [say $mathcalPint(ABC)$] The claim is proved by constructing state belonging to the set $mathPint(ABC)$ but not belonging to $mathcalBint(ABC)$.
  arXiv  Detail & Related papers  (2021-04-14T16:06:58Z)

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.