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.
Partial Transpose
Section titled “Partial Transpose”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.
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:
Thus, for two qubits, a negative eigenvalue of proves entanglement, while nonnegative eigenvalues prove separability. For and larger systems, PPT states can still be entangled. 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 with nonpositive partial transpose. 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.
Werner-State Example
Section titled “Werner-State Example”For the two-qubit Werner state
the partial transpose has one eigenvalue
The remaining eigenvalues 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.
Limitations
Section titled “Limitations”The PPT test and negativity are extremely useful, but their scope should be stated carefully:
- A negative eigenvalue of always proves entanglement.
- For and systems, PPT is also sufficient for separability.
- In higher dimensions, PPT does not imply separability.
- Negativity is blind to PPT entangled states.
- The value of negativity is not a measure of total correlation.
- The partial transpose depends on a chosen subsystem split, just like entanglement itself.
The safest practical workflow is: specify the bipartite split, compute , inspect its spectrum, and remember which dimensional theorem is being used.
Common Mistakes
Section titled “Common Mistakes”- Treating PPT as sufficient for separability in all dimensions.
- Forgetting that partial transpose is taken with respect to one subsystem, not the whole matrix.
- Confusing partial transpose with partial trace.
- Calling a zero negativity state separable in dimensions where PPT entanglement can occur.
- Forgetting to specify the product basis and subsystem split before writing matrix indices.
- Treating the partial transpose as a physical time evolution or allowed quantum channel.
Cross-Links
Section titled “Cross-Links”- Separable Mixed States
- Entangled States
- Entanglement Measures
- Bell States
- Classical Correlation versus Entanglement
- Local Unitary Equivalence
- Entanglement Depends on a Decomposition
- Reduced Density Operators
- Partial Trace
- Schmidt Decomposition
- Entanglement Entropy
- Concurrence for Two Qubits
- Mutual Information
- Entanglement Witnesses
- LOCC Preview
- Density Operators
- Eigenvalues and Eigenvectors
- Certification of Entanglement explains how PPT and NPT conclusions are supported from finite tomographic data and how their trust assumptions compare with steering and Bell tests.
References
Section titled “References”- A. Peres, “Separability Criterion for Density Matrices,” Physical Review Letters 77, 1413-1415, 1996.
- M. Horodecki, P. Horodecki, and R. Horodecki, “Separability of Mixed States: Necessary and Sufficient Conditions,” Physics Letters A 223, 1-8, 1996.
- G. Vidal and R. F. Werner, “Computable Measure of Entanglement,” Physical Review A 65, 032314, 2002.
- M. B. Plenio, “Logarithmic Negativity: A Full Entanglement Monotone That Is Not Convex,” Physical Review Letters 95, 090503, 2005.
- R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, “Quantum Entanglement,” Reviews of Modern Physics 81, 865-942, 2009.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
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 .
- Werner-state threshold. For , , and , compute .
Solution
Use
For , the expression is negative, so . For ,
For ,
- 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.