Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1002.2953

Criterion for k-separability in mixed multipartite systems

Gabriel, Andreas, Beatrix C. Hiesmayr, Marcus Huber

Published Feb 15, 2010• 38 citations
arXivHTMLPDF

Abstract

Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.

DOI
10.48550/arxiv.1002.2953

Related papers

Criterion for k-separability in mixed multipartite states

Andreas Gabriel, Beatrix C. Hiesmayr, Marcus Huber

Using a recently introduced framework, we derive criteria for quantum k-separability, which are easily computed. In the case k=2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.

Quantum Information and Computation•Sep 1, 2010•44 citations

k-separability criterion of mixed multipartite quantum states

Ting Gao, Yan Hong

The $k$-separability of mixed $n$-partite ($n\geq 3$) quantum states is mainly discussed in this paper. We obtain practical $k$-separability criteria to identify $k$-nonseparable mixed multipartite states in arbitrary dimensional quantum systems and detect genuine $n$-partite entanglement ($k=2$) and entanglement ($k=3$) which have previously not been identified. No optimization or eigenvalue evaluation is needed, our criteria can be evaluated by simple computations involving components of the density matrix and can be implemented in today's experiments.

•Apr 13, 2012•2 citations

A combinatorial criterion for k-separability of multipartite Dicke states

Zhihua Chen, Zhihao Ma, Ting Gao +1 more

We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where known criteria fail.

arXiv:1511.00103•Oct 31, 2015•0 citations

Efficient k-separability criteria for mixed multipartite quantum states

Ting Gao, Yan Hong, Yao Lu +1 more

We investigate classification and detection of entanglement of multipartite quantum states in a very general setting, and obtain efficient $k$-separability criteria for mixed multipartite states in arbitrary dimensional quantum systems. These criteria can be used to distinguish $n-1$ different classes of multipartite inseparable states and can detect many important multipartite entangled states such as GHZ states, W states, anti W states, and mixtures thereof. They detect $k$-nonseparable $n$-partite quantum states which have previously not been identified. Here $k=2,3,\cdots,n$. No optimization or eigenvalue evaluation is needed, and our criteria can be evaluated by simple computations involving components of the density matrix. Most importantly, they can be implemented in today's experiments by using at most $\mathcal{O}(n^2)$ local measurements.

arXiv:1204.2864•Europhysics Letters (EPL)•Oct 1, 2013•49 citations

Twopartite, combinatorial approach to partial k-separability problem for general multipartite states

Roman Gielerak Marek Sawerwain

We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods and some systematic procedures of combinatorial nature. Our methods are formalized in an algorithmic-like fashion and therefore they are easily implementable in a computer environments and might be effectively used for studying numerically these questions for sufficiently small systems

arXiv:1003.0103•Mar 1, 2010•1 citation

Separability Criteria for Quantum Mixed States in Terms of Trace Norm

Hui Zhao

A new necessary conditions for separability of mixed states in bipartite and multipartite quantum systems of arbitrary dimensions are presented. This method requires only a few local measurements. If a quantum state in a bipartite (or multipartite) system of arbitrary dimension is separable, we show that the trace norm of a constructive matrix is less than or equal to 1.

Chinese Physics Letters•Jun 28, 2006•3 citations
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.
The kkk-separability of mixed nnn-partite (n≥3n\geq 3n≥3) quantum states is mainly discussed in this paper. We obtain practical kkk-separability criteria to identify kkk-nonseparable mixed multipartite states in arbitrary dimensional quantum systems and detect genuine nnn-partite entanglement (k=2k=2k=2) and entanglement (k=3k=3k=3) which have previously not been identified. No optimization or eigenvalue evaluation is needed, our criteria can be evaluated by simple computations involving components of the density matrix and can be implemented in today's experiments.
We investigate classification and detection of entanglement of multipartite quantum states in a very general setting, and obtain efficient kkk-separability criteria for mixed multipartite states in arbitrary dimensional quantum systems. These criteria can be used to distinguish n−1n-1n−1 different classes of multipartite inseparable states and can detect many important multipartite entangled states such as GHZ states, W states, anti W states, and mixtures thereof. They detect kkk-nonseparable nnn-partite quantum states which have previously not been identified. Here k=2,3,⋯ ,nk=2,3,\cdots,nk=2,3,⋯,n. No optimization or eigenvalue evaluation is needed, and our criteria can be evaluated by simple computations involving components of the density matrix. Most importantly, they can be implemented in today's experiments by using at most O(n2)\mathcal{O}(n^2)O(n2) local measurements.
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods and some systematic procedures of combinatorial nature. Our methods are formalized in an algorithmic-like fashion and therefore they are easily implementable in a computer environments and might be effectively used for studying numerically these questions for sufficiently small systems