Detection of $k$-partite entanglement and $k$-nonseparability of multipartite quantum states

• URL: http://arxiv.org/abs/2012.02987v1
• Date: Sat, 5 Dec 2020 09:47:31 GMT
• Title: Detection of $k$-partite entanglement and $k$-nonseparability of multipartite quantum states
• Authors: Yan Hong, Ting Gao, Fengli Yan
• Abstract summary: Identifying the $k$-partite entanglement and $k$-nonseparability of general $N$-partite quantum states are fundamental issues in quantum information theory. We present some simple and powerful $k$-partite entanglement and $k$-nonseparability criteria that works very well.
• Score: 1.5125686694430571
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Identifying the $k$-partite entanglement and $k$-nonseparability of general $N$-partite quantum states are fundamental issues in quantum information theory. By use of computable inequalities of nonlinear operators, we present some simple and powerful $k$-partite entanglement and $k$-nonseparability criteria that works very well and allow for a simple and inexpensive test for the whole hierarchy of $k$-partite entanglement and $k$-separability of $N$-partite systems with $k$ running from $N$ down to 2. We illustrate their strengths by considering several examples in which our criteria perform better than other known detection criteria. We are able to detect $k$-partite entanglement and $k$-nonseparabilty of multipartite systems which have previously not been identified. In addition, our results can be implemented in today's experiments.

Related papers

• Entanglement hierarchies in multipartite scenarios [2.150800093140658]
  We present a whole set of hierarchical quantifications as a method of characterizing quantum states. We show that $k$-GM concurrence can unambiguously classify entangled states into $(n-1)$ distinct classes. In particular, $alpha$-$-GM concurrence $(0alpha1)$ determines that the GHZ state and the $W$ state belong to the same hierarchy.
  arXiv  Detail & Related papers  (2024-01-02T04:00:57Z)
• Multipartite entanglement detection via generalized Wigner-Yanase skew information [7.222232547612572]
  The detection of multipartite entanglement in multipartite quantum systems is a fundamental and key issue in quantum information theory. We develop two different approaches in form of inequalities to construct entanglement criteria, which are expressed in terms of the Wigner-Yanase skew information. Our results reveal some $k$-nonseparability and $k$-partite entanglement that remain undetected by other methods.
  arXiv  Detail & Related papers  (2023-09-20T03:30:15Z)
• Lower Bound of $l_{1}$ Norm of Coherence of Bipartite Qubit-Qudit System and its Application in the Detection of Entangled Tripartite Qudit-Qubit-Qudit System [0.0]
  We study the entanglement detection problem for the detection of bipartite higher dimensional entangled states and multipartite entangled states. We find that if any $l_1$ norm of coherence of bipartite qubit-qudit system is greater than the upper bound $U$ then the given qubit-qudit state is entangled.
  arXiv  Detail & Related papers  (2022-03-24T06:34:33Z)
• 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)
• Under-bagging Nearest Neighbors for Imbalanced Classification [63.026765294759876]
  We propose an ensemble learning algorithm called textitunder-bagging $k$-NN (textitunder-bagging $k$-NN) for imbalanced classification problems.
  arXiv  Detail & Related papers  (2021-09-01T14:10:38Z)
• Detection of multipartite entanglement via quantum Fisher information [1.345821655503426]
  We focus on two different kinds of multipartite correlation, $k$-nonseparability and $k$-partite entanglement. We propose effective methods to detect $k$-nonseparability and $k$-partite entanglement in terms of quantum Fisher information.
  arXiv  Detail & Related papers  (2021-03-12T08:28:12Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• 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)
• 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)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

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.