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

Chinese Physics B

A sufficient and necessary criterion for separability of bipartite quantum states

Hui Zhao, Xinyu Yu

Published Jul 31, 2014• 0 citations
Publisher

Abstract

A sufficient and necessary criterion for separability of bipartite quantum states is presented. We construct a class of mixed states in 2 ⊗ k quantum systems and in 3 ⊗ k quantum systems, respectively and show that these states are separable if and only if they are positive partial transpositions.
DOI
10.1088/1674-1056/23/8/080302

Related papers

A NOTE ON QUANTUM ENTANGLEMENT AND PPT

Shao-Ming Fei, Xianqing Li‐Jost

We study quantum states for which the PPT criterion is both sufficient and necessary for separability. We present a class of 3 × 3 bipartite mixed states and show that these states are separable if and only if they are PPT.

arXiv:0904.4766•International Journal of Quantum Information•Apr 1, 2009•4 citations

A class of separable quantum states

Yu Jing Guo, Jinchuan Hou

We present a sufficient condition for a bipartite state to be separable via the strong positive partial transposition structure introduced in Chru?ci?ski et?al (2008 Phys. Rev. A 77 022113), from which we obtain a class of separable states. In particular, we prove that any classical-quantum state is a state of our class but not vice versa. Both finite- and infinite-dimensional systems are considered.

Journal of Physics A Mathematical and Theoretical•Nov 21, 2012•18 citations

Separability of mixed quantum states: linear contractions approach

Michał Horodecki, Paweł Horodecki, Ryszard Horodecki

Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely triparite entanglement. We also show that for multipartite system any permutation of indices of density matrix leads to separability criterion.

arXiv:quant-ph/0206008•Jun 2, 2002•44 citations

Separability of Mixed Quantum States: Linear Contractions and Permutation Criteria

Michał Horodecki, Paweł Horodecki, Ryszard Horodecki

Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.

Open Systems & Information Dynamics•Mar 1, 2006•141 citations

Quantum separability criteria for arbitrary-dimensional multipartite states

Ming Li, Jing Wang, Shao-Ming Fei +1 more

We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our criteria are more powerful than the positive partial transposition criterion, the realignment criterion, and the criteria based on the correlation matrices.

arXiv:1402.4428•Physical Review A•Feb 18, 2014•56 citations

Bipartite separability and nonlocal quantum operations on graphs

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee +1 more

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension $m\ifmmode\times\else\texttimes\fi{}n$ arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

arXiv:1601.07704•Physical Review A•Jul 5, 2016•19 citations
Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely triparite entanglement. We also show that for multipartite system any permutation of indices of density matrix leads to separability criterion.
Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension $m\ifmmode\times\else\texttimes\fi{}n$ arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.