LOCC Transformations & Majorization
Nielsen's theorem: when one entangled state can become another.
When can one entangled pure state be turned into another by LOCC, with certainty? Nielsen's 1999 answer is a statement from the classical theory of inequalities: majorization. The picture it paints is rich. Some pairs of states are incomparable, a borrowed catalyst can unlock a forbidden conversion and be returned untouched, and in the many-copy limit everything collapses to a single number.
What you’ll learn
- Use the equivalent characterizations of majorization: partial sums, doubly stochastic matrices, convex functions and unitary mixing.
- State and prove Nielsen's theorem: by LOCC iff .
- Compute optimal conversion probabilities with Vidal's formula and recognize incomparable pairs.
- Explain entanglement catalysis and embezzlement, and how the single-copy rules relate to the asymptotic rate .
The majorization toolkit
Two consequences do most of the work below. First, Schur-concave functions such as the Shannon and Rényi entropies are monotone: . Second, Ky Fan's principle: the sum of the largest eigenvalues of a Hermitian equals over rank- projectors , so it is a convex function of .
Nielsen's theorem
Two reductions make the proof short. (i) Lo–Popescu: for pure bipartite states, any LOCC protocol, however many rounds it uses, can be replaced by a one-way protocol in which Alice measures with Kraus operators and Bob applies a unitary depending on her outcome. Bob's measurements can be traded for Alice's because of the symmetry of the Schmidt form. (ii) Bob's unitary does not change Alice's reduced state.
Every branch must end in .
Trace out Bob; his unitary drops out.
Polar decomposition: satisfies , so .
Use completeness, , then the previous line.
Ky Fan: the top- eigenvalue sum is convex, and unitary conjugation preserves spectra. Hence .
The matrix form of majorization (in a common eigenbasis, permutation matrices suffice, by Birkhoff–von Neumann).
Define Alice's measurement on the support of .
It is a valid measurement.
Outcome occurs with probability and leaves Alice's reduced state exactly equal to .
The post-measurement state is pure and has the same reduced state on Alice's side as , so the two differ only by a unitary on Bob's side. Alice announces and Bob applies it.
has Schmidt coefficients and has . Their entanglement entropies are and . Which statement is true?
- deterministically, since the entropy decreases
- deterministically
- Neither direction is possible with certainty: the states are incomparable
- Both directions are possible
Show the answer
C. Neither direction is possible with certainty: the states are incomparable
Partial sums: gives and gives . The condition holds at but fails at (); fails at (). A decrease of entropy is necessary, but far from sufficient.
Probabilistic conversions
The term always equals . Since the total is fixed, is equivalent to for all , so is exactly Nielsen's condition. Otherwise the bottleneck is the tail that cannot fill. The optimum is reached by a one-way protocol: Alice measures, Bob corrects.
has Schmidt coefficients . What is the maximal probability of converting it into the maximally entangled two-qutrit state ?
Show the answer
30 %
Tails of : ; tails of the target: . The ratios are , so . The smallest Schmidt coefficient is the bottleneck.
SLOCC. If any nonzero success probability is acceptable (stochastic LOCC), is possible iff for the Schmidt ranks; Vidal's formula is positive exactly then. So bipartite pure states fall into SLOCC classes labelled by the Schmidt rank alone. Three qubits already behave differently: there are two inequivalent classes of genuinely tripartite entanglement, GHZ and W (Dür, Vidal & Cirac, 2000); see Multipartite Entanglement.
Catalysis, embezzlement and many copies
Incomparable pairs can sometimes be converted with help: a catalyst , borrowed and returned in exactly the same state.
Which conversions does exact catalysis allow ("trumping")? Turgut and Klimesh (2007) characterized it by an infinite family of inequalities between Rényi-type entropies, so the entanglement entropy alone still does not decide single-copy catalytic conversions. Two variations change the picture:
- Embezzlement (van Dam & Hayden, 2003): the states satisfy by local unitaries alone, for any fixed , with error vanishing as . If a catalyst may be returned only approximately, any entangled state can be produced from nothing, so exactness is essential.
- Correlated catalysis: if the catalyst may end up correlated with the system while its own state is returned exactly, recent work shows that the entanglement entropy alone decides approximate convertibility of pure states (Kondra, Datta & Streltsov, 2021).
Expand and group the bit strings by their Hamming weight .
Projecting onto weight is local. Each outcome leaves a maximally entangled state of Schmidt rank , with probability .
With high probability , and Stirling's formula gives about ebits. A uniform state of rank converts into Bell pairs deterministically (Nielsen), losing less than one ebit.
Dilution reverses the process with about Bell pairs and only bits of communication (Lo & Popescu). So asymptotically is possible iff : the majorization inequalities collapse to a single entropy.
Key takeaways
- Majorization has equivalent forms (partial sums, doubly stochastic maps, convex functions, unitary mixing); entropies are Schur-concave.
- Nielsen: deterministically by LOCC iff , proved via the Lo–Popescu one-way reduction, polar decomposition and Ky Fan.
- Vidal: with tail sums ; SLOCC convertibility is decided by the Schmidt rank.
- Incomparable states exist; exact catalysts can unlock conversions, while embezzlement shows that inexact catalysis trivializes the theory.
- Asymptotically the inequalities collapse to one: the conversion rate is .
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
and . Which deterministic LOCC conversions are possible?
- only
- only
- Both
- Neither
Show the answer
A. only
Partial sums and give , so . The reverse fails at ().
What is the maximal probability of converting into ?
Show the answer
B.
Vidal: . Equivalently, Alice's filter reduces the amplitude to match the amplitude, succeeding with probability .
What does the Jonathan–Plenio example demonstrate?
- Entanglement entropy decides single-copy conversions
- Catalysts must be maximally entangled
- With a catalyst, LOCC can increase the Schmidt rank
- A borrowed entangled state, returned exactly, can enable a deterministic conversion that is otherwise impossible
Show the answer
D. A borrowed entangled state, returned exactly, can enable a deterministic conversion that is otherwise impossible
, yet with . The catalyst is not consumed.
In the proof of (⇒), which fact turns into ?
- The Cauchy–Schwarz inequality
- Hölder's inequality for Schatten norms
- Ky Fan's principle: the sum of the largest eigenvalues is convex
- The Holevo bound
Show the answer
C. Ky Fan's principle: the sum of the largest eigenvalues is convex
Applying Ky Fan to the convex combination bounds each top- eigenvalue sum of by the average of those of the unitary conjugates of , all equal to that of .
Further reading
- M. A. Nielsen, "Conditions for a class of entanglement transformations", Phys. Rev. Lett. 83, 436 (1999).
- G. Vidal, "Entanglement of pure states for a single copy", Phys. Rev. Lett. 83, 1046 (1999).
- D. Jonathan & M. B. Plenio, "Entanglement-assisted local manipulation of pure quantum states", Phys. Rev. Lett. 83, 3566 (1999).
- H.-K. Lo & S. Popescu, "Concentrating entanglement by local actions: Beyond mean values", Phys. Rev. A 63, 022301 (2001).
- M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, §12.5 (Cambridge, 10th anniv. ed., 2010).