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.
We explore the subtle relationships between partial separability and entanglement of subsystems in multiqubit quantum states and give experimentally accessible conditions that distinguish between various classes and levels of partial separability in a hierarchical order. These conditions take the form of bounds on the correlations of locally orthogonal observables. Violations of such inequalities give strong sufficient criteria for various forms of partial inseparability and multiqubit entanglement. The strength of these criteria is illustrated by showing that they are stronger than several other well-known entanglement criteria (the fidelity criterion, violation of Mermin-type separability inequalities, the Laskowski-\ifmmode \dot{Z}\else \.{Z}\fi{}ukowski criterion, and the D\"ur-Cirac criterion) and also by showing their great noise robustness for a variety of multiqubit states, including
N-qubit Greenberger-Horne-Zeilinger states and Dicke states. Furthermore, for $N\ensuremath{\geqslant}3$ they can detect bound entangled states. For all these states, the required number of measurement settings for implementation of the entanglement criteria is shown to be only
N+1. If one chooses the familiar Pauli matrices as single-qubit observables, the inequalities take the form of bounds on the antidiagonal matrix elements of a state in terms of its diagonal matrix elements.
We study entanglement in mixed bipartite quantum states which are invariant under simultaneous SU(2) transformations in both subsystems. Previous results on the behavior of such states under partial transposition are substantially extended. The spectrum of the partial transpose of a given SU(2)-invariant density matrix $\ensuremath{\rho}$ is entirely determined by the diagonal elements of $\ensuremath{\rho}$ in a basis of tensor-product states of both spins with respect to a common quantization axis. We construct a set of operators which act as entanglement witnesses on SU(2)-invariant states. A sufficient criterion for $\ensuremath{\rho}$ having a negative partial transpose is derived in terms of a simple spin correlator. The same condition is a necessary criterion for the partial transpose to have the maximum number of negative eigenvalues. Moreover, we derive a series of sum rules which uniquely determine the eigenvalues of the partial transpose in terms of a system of linear equations. Finally we compare our findings with other entanglement criteria including the reduction criterion, the majorization criterion, and the recently proposed local uncertainty relations.
We analyze the separability properties of density operators supported on ${C}^{2}\ensuremath{\bigotimes}{C}^{N}$ whose partial transposes are positive operators. We show that if the rank of $\ensuremath{\rho}$ equals N then it is separable, and that bound entangled states have ranks larger than N. We also give a separability criterion for a generic density operator such that the sum of its rank and the one of its partial transpose does not exceed
3N. If it exceeds this number, we show that one can subtract product vectors until it decreases to
3N, while keeping the positivity of $\ensuremath{\rho}$ and its partial transpose. This automatically gives us a sufficient criterion for separability for general density operators. We also prove that all density operators that remain invariant after partial transposition with respect to the first system are separable.
In this Letter, we show that the fulfillment of uncertainty relations is a sufficient criterion for a quantum-mechanically permissible state. We specifically construct two pseudospin observables for an arbitrary nonpositive Hermitian matrix whose uncertainty relation is violated. This method enables us to systematically derive separability conditions for all negative partial-transpose states in experimentally accessible forms. In particular, generalized entanglement criteria are derived from the Schrödinger-Robertson inequalities for bipartite continuous-variable states.
The
p3-PPT criterion is an experimentally viable relaxation of the well-known positive partial transposition (PPT) criterion for the certification of quantum entanglement. Recently, it has been generalized to various families of entanglement criteria based on the PT moments
pk=Tr
[(ρΓ)k], where
ρΓ denotes the partially transposed density matrix of a quantum state
ρ. While most of these generalizations are strictly more powerful than the
p3-PPT criterion, their
m-th level versions usually rely on the availability of
pk for all moment orders
k≤m. Here, we show that one can alternatively compare any three PT moments of orders
k<l<m, which can significantly reduce experimental overheads. More precisely, we show that any state satisfying $p_l>p_k^xp_m^{1-x} $ must be entangled, where
x=(m−l)/(m−k). Using the example of locally depolarized GHZ states, we identify the most promising versions of these three-moment criteria and compare their performance with a broad range of entanglement criteria. In the case of globally depolarized stabilizer states, we prove that having access to
pk for
k≤5 is sufficient to reproduce the full PPT criterion. More generally, we show that the Stieltjes-
m criterion is as powerful as the PPT criterion whenever
ρΓ has no more than
(m+1)/2 distinct eigenvalues. Finally, we introduce a notion of quantum weight enumerators that capture the decay of
pk under local white noise for arbitrary quantum states and illustrate this concept for an AME state. Our results contribute to the growing body of literature on higher-moment PPT relaxations and modern applications of weight enumerators in quantum error correction and information theory.