Negativity and Logarithmic Negativity
The Peres–Horodecki test asks a yes/no question: transpose one half of a bipartite density matrix and check whether the result is still a valid state. If a negative eigenvalue appears, the original was entangled. The negativity is what you get when you refuse to throw away the size of that violation — instead of reporting merely that has slipped below positivity, you add up how far it slipped, promoting a qualitative criterion into a quantitative entanglement measure. Two things make this the workhorse of the field. The first is computability. Almost every other entanglement measure — entanglement of formation, distillable entanglement, relative entropy of entanglement — hides an intractable optimization and is NP-hard in general. The negativity asks only that you diagonalize one Hermitian matrix of size . That is why it dominates the places where entanglement is hardest to pin down: mixed many-body states, conformal field theories, and continuous-variable optics, where reduced-state entropies no longer measure entanglement at all. The second is honesty about its own blind spot. Because the negativity sees exactly what the partial transpose sees, it vanishes on the bound entangled states — entangled yet with a positive partial transpose. So certifies separability only in the small worlds ( and ) where the PPT criterion is airtight. Everywhere else, negativity is a faithful lower witness — never the whole story, but very often the only piece you can actually calculate.
- The negativity sums the magnitudes of the negative eigenvalues of the partial transpose — the amount by which fails to be a state.
- Equivalently it is a trace-norm distance: , so a valid state sits at trace norm one and every unit of negativity pushes it above.
- The logarithmic negativity is additive and upper-bounds the distillable entanglement — the operational cousin of the negativity.
- Both are entanglement monotones — non-increasing under LOCC — and both are efficiently computable, but both are blind to PPT (bound) entangled states, so implies separability only in and .
- For a pure state is the Rényi- entropy of the Schmidt spectrum, , meeting the entropy only for a flat spectrum.
- Key idea: take the partial transpose, measure how far it falls below positivity in trace norm — that distance is the entanglement the PPT criterion can see, packaged as a computable monotone.
Take the partial transpose, measure how far it falls below positivity in trace norm — that distance is the entanglement the PPT criterion can see, packaged as a computable, LOCC-monotone number.
Where this lives today
The logarithmic negativity is now the default entanglement diagnostic wherever the reduced state is mixed — nearly everywhere interesting. In many-body physics and quantum field theory it is the tool of choice for the entanglement between two disjoint regions, or between a subregion and a thermal bath, where the entanglement entropy overcounts by mixing quantum correlation with classical thermal noise. Calabrese, Cardy and Tonni computed its universal scaling in -dimensional conformal field theories, and it is now a standard probe of quantum critical points, finite-temperature topological order, and thermalization after a quench, precisely because it stays meaningful where entropy-based measures fail. In continuous-variable quantum optics it has a closed form in the symplectic eigenvalues of the partially transposed covariance matrix, and it is the number reported to certify entanglement in two-mode squeezed light and optomechanical systems. Its additivity and computability make it a practical certificate in quantum-repeater engineering, where evaluating on a noisy shared state instantly bounds the distillable rate. And holographic constructions have imported the negativity into the study of black holes and the emergence of spacetime — a positivity test from 1996 now serving at the edge of quantum gravity.
The physical picture
A density matrix's eigenvalues are the weights of the states in some ensemble, so they must all be non-negative and sum to one. The partial transpose — transpose the indices of subsystem only — is a perfectly legal shuffle of matrix entries, but it is positive, not completely positive. Apply it to a separable state and every eigenvalue survives as a non-negative weight, because a separable state is a mixture of things the local transpose handles one term at a time. Apply it to an entangled state and the shuffle can manufacture a negative eigenvalue — a "probability" below zero, the unmistakable signature that no classical mixture could have produced these correlations. The negativity is the total weight of that impossible, negative probability. The first figure makes the accounting concrete. Transpose preserves the trace, so the eigenvalues of still sum to one; if one dips negative, the positive ones must overshoot to compensate. That is why the trace norm — the sum of absolute values — climbs above one by exactly twice the buried negativity: .
The negativity responds smoothly to how entangled the state is. As the Werner state is diluted with white noise its one dangerous eigenvalue climbs back toward zero, and at a sharp threshold the state becomes PPT and the negativity switches off. The second figure traces that switch-on: below , ; above it the negativity rises linearly to its maximum at the pure singlet, where reads exactly one ebit — entanglement as a tunable, computable function of a physical parameter.
The core equations
The definition is the whole idea in one line: collect the negative eigenvalues of the partial transpose. The two forms below are identical — one spectral, one a trace-norm excess — and the derivation that follows proves they agree from trace preservation alone.
where: — bipartite density operator on ; — partial transpose over ; — the trace norm; — eigenvalues of , the sum over negative ones. Read it as: how far below the positive cone has fallen, in trace-norm units. Taking the logarithm converts the multiplicative trace norm into an additive quantity — losing convexity, gaining additivity and an operational meaning. This is the logarithmic negativity, in ebits.
where: — logarithmic negativity in ebits; — the negativity, tied to it through . Because is monotone, and vanish together and order states identically. Everything rests on what the partial transpose does to matrix elements: swap the two indices of , leave untouched. In components, in any fixed product basis,
where: — basis labels of subsystem ; — basis labels of subsystem , exchanged by the transpose. The map is basis-dependent, but its spectrum — and hence — is not, since a local change of basis on merely conjugates by a transposed unitary. For a pure state the whole spectrum of is built from products of Schmidt coefficients, and the trace norm collapses to a perfect square — so becomes a Rényi entropy of the Schmidt spectrum, the cleanest closed form in the subject.
where: — Schmidt eigenvalues (squared coefficients), ; — the Schmidt coefficients. The right-hand side is exactly the Rényi- entropy , which sits above the von Neumann entanglement entropy. The reason deserves to be called an entanglement measure is that it cannot be forged by local operations and classical communication — it is an LOCC monotone: no local manipulation can raise it on average.
where: — any local-operations-and-classical-communication protocol; the second inequality is convexity. Together they certify that measures a resource free operations cannot create — the defining property of an entanglement monotone. The logarithmic negativity adds two properties the negativity lacks, exactly the ones a resource theory wants: it is additive across independent copies, and it bounds the rate at which pure entanglement can be distilled from the state.
where: — independent bipartite systems; — distillable entanglement, the maximal asymptotic ebit rate extractable by LOCC. No protocol can distill faster than permits. Finally, the family that makes this concrete: the two-qubit Werner state, a singlet mixed with white noise, dissected in both figures above. Its negativity has a closed form with a sharp entanglement threshold.
where: — singlet fraction, ; — the singlet; — the identity. The state is entangled () precisely for , the PPT threshold for this family.
The goal is to prove that the two expressions in equation (1) are the same number — that the spectral sum of negative eigenvalues equals the trace-norm excess over one — using only two facts: the partial transpose preserves the trace, and the trace norm of a Hermitian matrix is the sum of absolute eigenvalues. This is the identity that lets a computation report either the eigenvalue sum or the trace norm and mean the same thing, and it is why is the natural bookkeeping for negativity.
Step 1. is Hermitian, so it has real eigenvalues , and transposition preserves the trace: . Why: the total weight is conserved even as eigenvalues are rearranged into possibly-negative values — the negativity is paid out of the positive part.
Step 2. Split the spectrum and write the trace norm as . Why: the absolute value flips only the negative eigenvalues, so the two contributions add rather than cancel.
Step 3. Eliminate the positive sum with Step 1, , giving . Why: the trace constraint fixes the entire trace norm from the negative eigenvalues alone.
Step 4. Rearrange: , recovering both forms of equation (1); a valid state has , , . Why: the negativity is literally a distance — how far has been pushed outside the set of density matrices, in trace norm.
Go deeper · Derivation B · 1 minNegativity of the two-qubit Werner state
The goal is to compute equation (7) from scratch by diagonalizing the partial transpose of the Werner state, and to locate the entanglement threshold as the exact point where a single eigenvalue crosses zero. This is the canonical worked case of the subject — a one-parameter family from maximally mixed noise to a pure singlet — on which every claim about negativity can be checked by hand.
Step 1. In the basis the singlet contributes on the diagonal and on their cross terms; adding gives diagonal with off-diagonal linking and . Why: the singlet lives entirely in the sector, so only that block carries coherence.
Step 2. Partial-transpose on : diagonal entries are untouched, but the coherence has its index swapped, becoming (and its conjugate). Why: the transpose moves the off-diagonal weight into the sector — the single act that can create a negative eigenvalue.
Step 3. The result is block-diagonal: the block has both entries ; the block has eigenvalues and . Why: a symmetric off-diagonal block splits into sum and difference eigenvalues; the difference branch is the one that can go negative.
Step 4. The spectrum is (thrice) and (once). The lone eigenvalue is negative exactly when , so there and otherwise. Why: only one eigenvalue ever dips below zero, and its sign change is the sharp PPT threshold of the second figure.
Step 5. Endpoints: at (pure singlet) , ebit; at both vanish continuously. Why: recovering one ebit for the Bell state and a clean switch-off confirms the calculation against known limits.
Go deeper · Derivation C · 1 minPure-state log-negativity is a Rényi one-half entropy
The goal is to derive equation (4) — that a pure state's logarithmic negativity equals twice the log of the sum of Schmidt coefficients — and to show it is the Rényi- entropy of the reduced spectrum, which always sits at or above the von Neumann entanglement entropy. This is why, for pure states, negativity and entropy agree only at maximal entanglement. Start from the Schmidt form and build block by block.
Step 1. In the Schmidt basis . Transposing the index sends , so . Why: the transpose converts diagonal Schmidt correlations into off-diagonal swaps between distinct index pairs.
Step 2. Read off the blocks: diagonal terms give eigenvalues ; each pair forms a block with eigenvalues . Why: an off-diagonal symmetric block has eigenvalues plus and minus its entry, so every distinct Schmidt pair contributes one negative eigenvalue — the origin of pure-state negativity.
Step 3. Sum the magnitudes: , completing the square via ; then . Why: the diagonal weights and doubled off-diagonal magnitudes are exactly a squared sum — the closed form of equation (4).
Step 4. Identify the entropy: , and since Rényi entropies decrease in order, , equal only for a flat spectrum . Why: pure-state log-negativity is a Rényi entropy of the Schmidt weights, so it upper-bounds the entanglement entropy and meets it only when all nonzero coefficients are equal.
Limiting cases
The negativity specializes cleanly across the regimes that matter, from its blind spot to its saturation:
| Case | Result | Meaning |
|---|---|---|
| Separable or PPT state | Vanishes for every separable state — but also for bound (PPT) entangled states, the blind spot inherited from the PPT criterion. | |
| Maximally entangled qudit | Saturates the scale; a Bell pair () gives ebit, . | |
| Pure state, Schmidt spectrum | A Rényi- entropy of the Schmidt spectrum, generally exceeding the von Neumann entanglement entropy. | |
| Two-qubit Werner state | Detects entanglement exactly for , matching the PPT threshold for this family. | |
| Gaussian state (continuous variable) | Closed form from the symplectic eigenvalues of the partially transposed covariance matrix — the CV workhorse. |
Worked examples
1 · Negativity of a noisy Werner state, end to end (fully worked)
A noisy channel leaves the Werner state with singlet fraction . Compute the partial-transpose spectrum, negativity, logarithmic negativity, and cross-check against the two-qubit concurrence.
Step 1. The partial-transpose eigenvalues are (thrice) and (once). At : (three of them) and , summing to , the conserved trace.
Step 2. Only one eigenvalue is negative, so . Equivalently and — the two routes agree.
Step 3. Logarithmic negativity: , well below the one ebit of a pure singlet — the noise has eaten most, though not all, of the entanglement.
Step 4. Cross-check with concurrence. For the Werner family , so exactly — a relation holding for every two-qubit pure state and for the Werner family. The state is entangled with , ebit, ; it becomes PPT-separable only at .
2 · A partially entangled pure state: negativity versus entropy
Take , already in Schmidt form. Find its negativity, logarithmic negativity, and entanglement entropy, and confirm exceeds the entropy.
Step 1. The Schmidt eigenvalues are with Schmidt coefficients and . Their sum is .
Step 2. Trace norm of the partial transpose: . Hence the negativity and .
Step 3. Von Neumann entanglement entropy: . As predicted, — the log-negativity is the larger Rényi- entropy, and the two coincide only for a flat () spectrum.
Step 4. Concurrence check: , and indeed , as in Example 1. A non-maximal pure state: , ebit, ebit, — negativity and entropy measure the same entanglement on different scales.
3 · The maximally entangled qudit benchmark
Evaluate and for , then specialize to a qutrit.
Step 1. All Schmidt coefficients equal , so and ; hence and . For the qutrit this is and . The maximally entangled qudit sets the ceiling , with the Bell pair the corner ( ebit, ).
Physics of the portrait
The negativity has no single inventor — it is a relay across four groups over a decade, from a positivity test, to a volume measure, to a proven monotone, to an additive operational bound. The concept card below tracks that relay.
Origins · 1 minnegativity and how this was discovered
The negativity was assembled, not discovered in one stroke. Its foundation is Asher Peres's 1996 observation that a separable state must stay positive under partial transposition — a checkable necessary condition that the Horodecki family (Michał, Paweł and Ryszard) proved the same year to be also sufficient in the smallest cases, and . That made "does a negative eigenvalue appear?" a decision procedure, but it was still a yes/no test. Two years later Karol Życzkowski, Paweł Horodecki, Anna Sanpera and Maciej Lewenstein, studying the geometry of the separable set, defined the negativity as the amount of that violation. The measure earned its credentials in 2002, when Guifré Vidal and Reinhard F. Werner proved that both the negativity and its logarithm are entanglement monotones — and stressed the property that made them famous: unlike almost every rival measure, they are computable, needing only one diagonalization. Finally, in 2005 Martin Plenio isolated the logarithmic negativity as a full monotone that is additive and upper-bounds the distillable entanglement, giving it a clean operational role even though it fails to be convex. What began as a positivity check ended as the most-used quantitative measure of mixed-state entanglement in physics.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, §12.5 (mixed-state entanglement) · Vidal & Werner, Computable measure of entanglement, Phys. Rev. A 65, 032314 (2002) · Plenio, Logarithmic Negativity: A Full Entanglement Monotone That is not Convex, Phys. Rev. Lett. 95, 090503 (2005) · Watrous, The Theory of Quantum Information, Ch. 6 · Wilde, Quantum Information Theory, Ch. 11 · Horodecki, Horodecki, Horodecki & Horodecki, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009).
Provenance. The definition and monotonicity follow Vidal & Werner (2002); the additivity and distillable-entanglement bound follow Plenio (2005); the negativity as a measure was introduced by Życzkowski, Horodecki, Sanpera & Lewenstein, Phys. Rev. A 58, 883 (1998), on the PPT foundation of Peres (1996) and Horodecki³ (1996). A verifier should recompute: (1) the identity from trace preservation; (2) the Werner spectrum with threshold , and at the values , , ; (3) the pure-state result and, for , , ; (4) the benchmarks , , giving at . All numbers are standard and textbook-verifiable.
Prerequisites. PPT Criterion and the Peres–Horodecki Test · Separable versus Entangled States · Schmidt Decomposition · Entanglement Entropy of Pure States. Leads to. Entanglement Witnesses · Concurrence and Wootters' Formula · Bell States and EPR Pairs.
Ask the tutor: Hand me any density matrix — a noisy Bell pair, a Werner state, a two-mode squeezed vacuum — and I will take its partial transpose, find the negative eigenvalues, and walk you through what its negativity and logarithmic negativity say about how entangled it is.
Is the negativity the same thing as the PPT criterion?
They are two readings of the same object. The PPT criterion asks a yes/no question — does have any negative eigenvalue? — and answers "entangled" if it does. The negativity answers the quantitative follow-up: how much negativity is there, summed over all negative eigenvalues? The criterion is the sign of a violation; the negativity is its size. Because they share the same underlying test, they share the same blind spot: a state with passes the criterion and has , whether it is truly separable or bound entangled. The negativity adds a magnitude to the PPT verdict without changing what that verdict can detect.
Why does the negativity miss bound entangled states?
Because it is built entirely on the partial transpose, and bound entangled states are defined by having a positive partial transpose despite being entangled. If , none of its eigenvalues are negative, so — the measure has nothing to add up. This is not a flaw; it is the exact scope of the PPT criterion showing through. In and systems no PPT entangled states exist, so the negativity is faithful there. In higher dimensions they do exist, and detecting them requires different tools — entanglement witnesses tailored to the state, or the range criterion — none as cheap to compute as the negativity.
The negativity is convex but the logarithmic negativity is not — does that matter?
It matters for what each is good at. The negativity inherits convexity from the triangle inequality of the trace norm, so it never increases when you mix states — a natural property for a measure. The logarithmic negativity loses convexity, because the log of a convex function need not be convex. In exchange it gains additivity: of independent copies is exactly times of one, which convex measures generally fail. Additivity is what lets serve as a clean asymptotic bound on distillable entanglement and entanglement cost. So the two are a deliberate trade: convexity () or additivity and operational meaning (), but not both in one quantity.
How does the pure-state negativity compare with the entanglement entropy?
For a pure state both are functions of the Schmidt spectrum , but different functions. The entanglement entropy is , while is exactly the Rényi- entropy of the same spectrum. Because Rényi entropies decrease with their order, the order- value sits at or above the order-1 value, so for every pure state. Equality holds only for a flat spectrum — all nonzero coefficients equal, the maximally entangled case within a rank. For any partially entangled pure state, such as the example, the log-negativity strictly overshoots the entanglement entropy.
Can I use the negativity for continuous-variable or Gaussian states?
Yes, and it is the standard measure there. A Gaussian state is captured entirely by its covariance matrix, and partial transposition acts as a simple sign flip on the momentum quadratures of one subsystem. You then compute the symplectic eigenvalues of the partially transposed covariance matrix, and — a closed form needing no diagonalization of an infinite-dimensional density matrix. A symplectic eigenvalue below one signals entanglement, exactly as a negative eigenvalue does in the discrete case. This is why the log-negativity, not the entropy, is the figure of merit quoted for two-mode squeezed vacua and optomechanical entanglement.
Why is negativity used in many-body physics instead of the entanglement entropy?
The entanglement entropy only measures entanglement for pure states. In a many-body system at finite temperature, or between two regions and that do not together make up the whole system, the reduced state is mixed, and its von Neumann entropy counts classical and thermal correlations along with the quantum ones. The logarithmic negativity is a genuine entanglement monotone for mixed states, so it isolates the quantum part. That is decisive for the entanglement between two disjoint intervals in a critical chain, or its survival above a phase transition, where entropy-based diagnostics mislead. Its universal scaling in conformal field theory, computed via a replica trick on the partial transpose, has made it a primary probe of quantum criticality and thermalization.