Strong quantum nonlocality without entanglement in $n$-partite system with even $n$

• URL: http://arxiv.org/abs/2208.07051v4
• Date: Wed, 26 Apr 2023 08:10:19 GMT
• Title: Strong quantum nonlocality without entanglement in $n$-partite system with even $n$
• Authors: Huaqi Zhou, Ting Gao, Fengli Yan
• Abstract summary: We find general construction of strongly nonlocal product sets in space. We present a local entangled state discrimination protocol for our sets. As an application, we connect our sets with local information hiding in multipartite system.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In multipartite systems, great progress has been made recently on the study of strong quantum nonlocality without entanglement. However, the existence of orthogonal product sets with strong quantum nonlocality in even party systems remains unknown. Here the even number is greater than four. In this paper, we successfully construct strongly nonlocal orthogonal product sets in $n$-partite systems for all even $n$, which answers the open questions given by Halder et al. [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.122.040403} {Phys. Rev. Lett \textbf{122}, 040403 (2019)}] and Yuan et al. [\href{https://journals.aps.org/pra/abstract/10.1103/PhysRevA.102.042228} {Phys. Rev. A \textbf{102}, 042228 (2020)}] for any possible even party systems. Thus, we find general construction of strongly nonlocal orthogonal product sets in space $\otimes_{i=1}^{n}\mathcal{C}^{d_{i}}$ ($n,d_{i}\geq 3$) and show that there do exist incomplete orthogonal product bases that can be strongly nonlocal in any possible $n$-partite systems for all even $n$. Our newly constructed orthogonal product sets are asymmetric. We analyze the differences and connections between these sets and the known orthogonal product sets in odd party systems. In addition, we present a local state discrimination protocol for our sets by using additional entangled resource. When at least two subsystems have dimensions greater than three, the protocol consumes less entanglement than teleportation-based protocol. Strongly nonlocal set implies that the information cannot be completely accessed as long as it does not happen that all parties are together. As an application, we connect our sets with local information hiding in multipartite system.

Related papers

• Strong quantum nonlocality without entanglement in every $(n-1)$-partition [0.0]
  Rigorous proofs show that these sets are locally irreducible in every $(n-1)-partition. Our results can also enhance one understanding for the nonlocality without entanglement.
  arXiv  Detail & Related papers  (2024-07-03T13:57:10Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• 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)
• 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)
• Strong quantum nonlocality and unextendibility without entanglement in $N$-partite systems with odd $N$ [11.391485203897044]
  The existence of strongly nonlocal product sets in multipartite systems remains unknown. We give explicit constructions of unextendible product bases in $N$-partite systems for odd $Ngeq 3$.
  arXiv  Detail & Related papers  (2022-03-28T05:15:44Z)
• Bounds on the smallest sets of quantum states with special quantum nonlocality [2.1991772588394825]
  We find that in the case of two qubits systems locally stable sets are coincide with locally indistinguishable sets. We present a characterization of locally stable sets via the dimensions of some states depended spaces.
  arXiv  Detail & Related papers  (2022-02-18T05:58:17Z)
• Strong quantum nonlocality in $N$-partite systems [16.790803450555885]
  We show that a strongly nonlocal set of entangled states exists in $(mathbbCd)otimes N$ for all $Ngeq 3$ and $dgeq 2$. We connect quantum nonlocality with local hiding of information as an application.
  arXiv  Detail & Related papers  (2022-02-15T02:19:46Z)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• Strong quantum nonlocality from hypercubes [14.686974497801048]
  We build the connection between hypercubes and strongly nonlocal OPSs, and exhibit the phenomenon of strong quantum nonlocality without entanglement in multipartite systems. Our results build the connection between hypercubes and strongly nonlocal OPSs, and exhibit the phenomenon of strong quantum nonlocality without entanglement in multipartite systems.
  arXiv  Detail & Related papers  (2021-10-16T03:44:44Z)
• Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
  We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting. We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$. Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
  arXiv  Detail & Related papers  (2020-05-13T16:44:12Z)

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.