Negativity and PPT Criterion
The positive-partial-transpose criterion is one of the most useful first tests for mixed-state entanglement. It starts from a simple operation on one subsystem: transpose the matrix indices belonging to that subsystem while leaving the other subsystem alone.
If the resulting operator is not positive semidefinite, the original state is entangled. This gives a practical entanglement diagnostic called the PPT test. The associated scalar measure, negativity, adds up the negative eigenvalue weight of the partial transpose.
The test is powerful but not universal: in and dimensions, PPT is equivalent to separability; in higher dimensions, some entangled states are PPT.
Helpful background. Separable mixed states supplies the convex-mixture definition; eigenvalues determine matrix positivity. This page treats finite-dimensional tensor products.
Partial transpose on one subsystem
Section titled “Partial transpose on one subsystem”Choose product bases and . A bipartite density operator can be expanded as
The partial transpose on subsystem is
Only the matrix indices are transposed. Equivalently,
The operation depends on a chosen product basis for writing the transpose, but the positivity or nonpositivity of is invariant under local changes of basis.
For a two-qubit matrix in the order , view as a array of -blocks. Transpose each block in place, without interchanging the blocks. This implements .
For an active local unitary, the transformed partial transpose is
This is a unitary conjugation, explaining the invariance of its eigenvalues and negativity.
Why Separable States Are PPT
Section titled “Why Separable States Are PPT”Suppose is separable:
Then
The transpose of a positive matrix is positive, so each term is positive semidefinite. A convex sum of positive semidefinite operators is positive semidefinite. Therefore
This implication is the heart of the test. If has a negative eigenvalue, then cannot be separable.
The PPT Criterion
Section titled “The PPT Criterion”A state is called PPT if its partial transpose is positive semidefinite:
The criterion has three standard levels:
| Subsystem dimensions | Meaning of a positive partial transpose |
|---|---|
| Necessary and sufficient for separability | |
| (or ) | Necessary and sufficient for separability |
| , , and dimensions containing either case | Necessary, but not sufficient in general |
Thus, for two qubits, a negative eigenvalue of proves entanglement, while nonnegative eigenvalues prove separability. For example, and systems admit PPT entangled states. Such states are examples of PPT entanglement, often discussed together with bound entanglement. Entanglement Distillation explains why PPT is an LOCC obstruction to extracting Bell pairs and separates that theorem from the still-open general NPT distillability problem.
Negativity
Section titled “Negativity”Negativity turns the partial-transpose test into a number. Let be the eigenvalues of . The negativity is
Equivalently,
where is the trace norm.
The logarithmic negativity is
Negativity is zero for all separable states. It is positive for states whose partial transpose has a negative eigenvalue (NPT). It is not a complete entanglement measure in dimensions where PPT entangled states exist.
Bell-State Example
Section titled “Bell-State Example”Consider
The density operator is
Partial transposition on gives
In the product basis
this has eigenvalues
Therefore the Bell state is entangled, with
Pure Two-Qubit Schmidt Form
Section titled “Pure Two-Qubit Schmidt Form”For
the eigenvalues of are
Thus
For two-qubit pure states, this is one half of the concurrence:
This simple relation is special to two-qubit pure states.
Pure states with more Schmidt terms
Section titled “Pure states with more Schmidt terms”For , partial transpose produces eigenvalues and pairs for each . The two-dimensional block on is . Hence
For a pure state, logarithmic negativity equals the order- Rényi entropy of either marginal, generally different from von Neumann entanglement entropy. A maximally entangled state of Schmidt rank has and .
Werner-State Example
Section titled “Werner-State Example”For the two-qubit Werner state
the partial transpose has one eigenvalue
The other three eigenvalues are all and are nonnegative. Hence
The state is NPT, and therefore entangled, exactly when
For two qubits this agrees with the separability threshold. It also matches the concurrence threshold, although the numerical values of concurrence and negativity differ:
Partial Transpose Is Not a Physical Channel
Section titled “Partial Transpose Is Not a Physical Channel”The transpose map sends positive matrices to positive matrices, but it is not completely positive. This is why applying it to only one subsystem can reveal entanglement.
If is entangled, the formal operation
may produce an operator that is not a density operator. That failure of positivity is not a physical state transformation; it is a diagnostic signature.
This also explains why partial transpose is different from a partial trace. The partial trace produces a valid reduced state. The partial transpose is a mathematical test on the joint density operator.
Interpreting small negative eigenvalues
Section titled “Interpreting small negative eigenvalues”Partial transpose preserves Hermiticity and trace. Check these first, alongside the positivity and normalization of the original density matrix. With exact data, any negative eigenvalue certifies entanglement. With numerical or tomographic data, an eigenvalue of order the calculation’s uncertainty does not justify the same conclusion; propagate errors or use a justified tolerance. Entanglement certification develops the statistical version.
Negativity vanishes on every PPT state, including PPT entangled states in higher dimensions. It is therefore an entanglement monotone that is not faithful in all dimensions: zero does not universally mean separable. Logarithmic negativity is additive under tensor products; ordinary negativity instead obeys .
References
Section titled “References”- M. Horodecki, P. Horodecki, and R. Horodecki, “Separability of mixed states: necessary and sufficient conditions”, Physics Letters A 223, 1–8 (1996), DOI: 10.1016/S0375-9601(96)00706-2.
- A. Peres, “Separability criterion for density matrices”, Physical Review Letters 77, 1413–1415 (1996).
- M. B. Plenio, “Logarithmic negativity: a full entanglement monotone that is not convex”, Physical Review Letters 95, 090503 (2005).
- G. Vidal and R. F. Werner, “Computable measure of entanglement”, Physical Review A 65, 032314 (2002).
Exercises
Section titled “Exercises”- Separable states are PPT. Show directly that a product density operator has positive partial transpose. Then extend the argument to separable mixtures.
Solution
For a product state,
Since is positive semidefinite, is positive semidefinite. Therefore is positive semidefinite. A separable state is a convex sum of such product density operators, and a convex sum of positive semidefinite operators is positive semidefinite.
- Bell-state negativity. Starting from in the Bell-state example, identify the eigenvector with negative eigenvalue.
Solution
The only nontrivial block acts on the span of and :
The antisymmetric vector
has eigenvalue . Therefore the negativity is .
- Two Bell pairs. Regard as a state across . Compute its negativity and logarithmic negativity. Why is ordinary negativity not additive?
Solution
There are four Schmidt coefficients, each . Thus and . Each individual Bell pair has negativity , so their sum is , not . It is the trace norm that multiplies, and its logarithm that adds.
- Transposing subsystem A instead of B. Show that and have the same eigenvalues.
Solution
The full transpose of is
A matrix and its transpose have the same characteristic polynomial, so they have the same eigenvalues. Therefore it does not matter whether one tests positivity of or ; the spectra agree.