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:1407.3088

Partial Transpose As A General Criterion for the Separability of Quantum States

P Pranav, M. Ravendranadhan

Published Jul 11, 2014• 0 citations
arXivHTMLPDF

Abstract

Usual separability criteria applicable to distinguishable particles are not applicable to identical particles. Here we show that Partial transposition and symmetrization (or anti symmetrization) of density matrix of bipartite boson systems (fermion systems) can be used to check whether a state is separable or not.By using determinant based separability criteria it has been found that bipartite states of identical particles are always separable. It is found that partial transposition and symmetrization is equivalent to realignment criteria proposed by Wu.

DOI
10.48550/arxiv.1407.3088

Related papers

A note on separability criteria for multipartite state

Heng Fan

The recent proposed realignment separability criterion for mixed is analyzed. We identify the essential part of this criterion is a swap operator followed by a partial transposition. Then we analyze the separability criterion of permutation indices of the density matrix for multipartite state which is a generalization of the realignment criterion. We give a method to solve the equivalence problem of the separability criterion of permutation indices of the density matrix. For tripartite state, we show the non-trivial separability criteria are either partial transposition criterion or realignment criterion.

arXiv:quant-ph/0210168•Oct 24, 2002•20 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

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

Generalized reduction criterion for separability of quantum states

Sergio A Albeverio, Kai Chen, Shao-Ming Fei

A necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L. A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The separability criterion naturally generalizes the reduction separability criterion introduced independently in the previous work [M. Horodecki and P. Horodecki, Phys. Rev. A 59, 4206 (1999) and N. J. Cerf, C. Adami, and R. M. Gingrich, Phys. Rev. A 60, 898 (1999)]. In special cases, it recovers the previous reduction criterion and the recent generalized partial transposition criterion [K. Chen and L. A. Wu, Phys. Lett. A 306, 14 (2002)]. The criterion involves only simple matrix manipulations and can therefore be easily applied.

arXiv:quant-ph/0312185•Physical Review A•Dec 17, 2003•63 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

Partial transpose criteria for symmetric states

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-$j$ state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.

arXiv:1606.07635•Physical Review A•Oct 31, 2016•29 citations
Usual separability criteria applicable to distinguishable particles are not applicable to identical particles. Here we show that Partial transposition and symmetrization (or anti symmetrization) of density matrix of bipartite boson systems (fermion systems) can be used to check whether a state is separable or not.By using determinant based separability criteria it has been found that bipartite states of identical particles are always separable. It is found that partial transposition and symmetrization is equivalent to realignment criteria proposed by Wu.
The recent proposed realignment separability criterion for mixed is analyzed. We identify the essential part of this criterion is a swap operator followed by a partial transposition. Then we analyze the separability criterion of permutation indices of the density matrix for multipartite state which is a generalization of the realignment criterion. We give a method to solve the equivalence problem of the separability criterion of permutation indices of the density matrix. For tripartite state, we show the non-trivial separability criteria are either partial transposition criterion or realignment 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.
A necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L. A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The separability criterion naturally generalizes the reduction separability criterion introduced independently in the previous work [M. Horodecki and P. Horodecki, Phys. Rev. A 59, 4206 (1999) and N. J. Cerf, C. Adami, and R. M. Gingrich, Phys. Rev. A 60, 898 (1999)]. In special cases, it recovers the previous reduction criterion and the recent generalized partial transposition criterion [K. Chen and L. A. Wu, Phys. Lett. A 306, 14 (2002)]. The criterion involves only simple matrix manipulations and can therefore be easily applied.
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.
We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-jjj state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.