Lesson 15 · 60 min · core
Von Neumann & Entanglement Entropy
The von Neumann entropy measures, in bits, how far a density operator is from a pure state. We define it through the functional calculus, prove the bounds with Jensen's inequality, show that it is invariant under unitaries, and use the Schmidt decomposition to prove that both halves of a pure bipartite state have the same entropy. That common value, the entanglement entropy, is computed exactly for and for every marginal of the three-qubit GHZ state.
Prerequisites: Partial Trace & Reduced States, Spectral Theorem & Functions of Operators
Objectives and key results
Compute from the spectrum of , using the convention justified by .
Prove with equality exactly for pure states (lower bound) and for the maximally mixed state (upper bound).
Prove and for every pure , and use as the entanglement measure of pure bipartite states.
Evaluate with the binary entropy and show that every one- and two-qubit marginal of the GHZ state carries exactly one bit.
- definition · Von Neumann entropy
- theorem · Entropy bounds
- identity · Unitary invariance
- theorem · Equal marginal entropies of a pure state
- formula · Binary entropy
Defining the entropy of a density operator#
In the partial-trace lesson we saw that a subsystem of an entangled pure state is described by a mixed density operator: . We now want a single number that says how mixed a density operator is. Classically, the Shannon entropy of a probability vector counts the average number of bits of missing information. A density operator is Hermitian, positive semidefinite and has unit trace, so by the spectral theorem it is a probability distribution over an orthonormal eigenbasis : The von Neumann entropy is the Shannon entropy of this spectrum. Throughout the lesson logarithms are base , so entropies are measured in bits; to convert to nats multiply by .
Definition
Von Neumann entropy
For a density operator on , , where is the function applied to by the functional calculus, with . Equivalently over the eigenvalues of .
From the trace formula to the eigenvalue formula
- Step 1:Spectral theorem for the Hermitian operator ; positivity gives and gives .
- Step 2:Functional calculus with . Applying in one go avoids forming on its own, which is undefined when has a zero eigenvalue.
- Step 3:Linearity of the trace and .
- Step 4:Each ; multiply by .
Result
Why : the limit
- Step 1:Change of base, ; the constant factor does not affect the limit.
- Step 2:Rewrite the indeterminate form as the quotient , to which L'Hôpital's rule applies.
- Step 3:L'Hôpital: numerator and denominator are differentiable on , both diverge, and the derivative of the denominator, , never vanishes there.
- Step 4:Simplify .
- Step 5:Defining as the limit makes continuous on the closed interval, so is a continuous function of the eigenvalues and zero-probability eigenvectors contribute nothing.
First examples. A pure state has spectrum , so . The single-qubit maximally mixed state has spectrum and bit. The qubit state has bits: less than one bit because a measurement in the computational basis is somewhat predictable. A crucial warning: the entropy is computed from the eigenvalues, not from the diagonal. The pure state has diagonal but eigenvalues , so , not .
Definition
Binary entropy
For , with . Every qubit density operator with eigenvalues has . The function is symmetric, , satisfies , and has derivative , which vanishes only at where attains its maximum .
Bounds and unitary invariance#
Entropy bounds
For every density operator on , . The lower bound is attained exactly for pure states and the upper bound exactly for the maximally mixed state .
Proof (10 steps)
- Step 1:Each eigenvalue is non-negative and they sum to one, so none exceeds one. Terms with are zero by the convention .
- Step 2:A sum of non-negative terms is non-negative: the lower bound holds termwise.
- Step 3:on only at ; with exactly one eigenvalue equals one, so is a rank-one projector, i.e. pure.
- Step 4:For the upper bound restrict every sum to the nonzero eigenvalues; the dropped terms are zero.
- Step 5:Write (the weights sum to one) and combine the logarithms: . This is Gibbs' inequality in the making.
- Step 6:Jensen's inequality for the concave function with probability weights , , at the points : .
- Step 7:Each summand collapses to , there are of them, and makes , whose logarithm is at most .
- Step 8:Combine the three previous lines.
- Step 9:Equality in Jensen for the strictly concave forces all to be equal, i.e. the are equal on ; equality in forces . Together for all eigenvalues.
- Step 10:Completeness gives the unique maximiser, and the direct evaluation confirms it attains the bound.
∎
Unitary invariance
For every density operator and every unitary on the same space, . In particular the entropy depends only on the spectrum of , not on the basis, and closed-system evolution never changes it.
Proof (5 steps)
- Step 1:Conjugate the spectral decomposition term by term; .
- Step 2:: the rotated eigenvectors are again orthonormal, so the line above is a spectral decomposition of .
- Step 3:Same eigenvalues, different eigenvectors.
- Step 4:The eigenvalue formula only sees the spectrum.
- Step 5:The functional calculus commutes with unitary conjugation (apply it to the decomposition in the first line), and the trace is cyclic.
∎
Additivity on product states
- Step 1:Kronecker product of the two spectral decompositions; is an orthonormal basis of , so the eigenvalues are the products .
- Step 2:Eigenvalue formula and (terms with vanish on both sides).
- Step 3:Factor the double sums and use .
Result
Unitary verified: (max deviation 0.0e+0)
Entanglement entropy of pure bipartite states#
A pure global state has : there is nothing unknown about the whole. Yet its parts may be mixed. For each qubit alone is with one full bit of entropy. The ignorance about the part is not ignorance about the world; it is the signature of correlations that no local description can hold. This motivates using the entropy of a marginal as a measure of entanglement. For this to be well defined it must not matter which side we trace out, and the Schmidt decomposition proves exactly that.
Both marginals of a pure state have the same entropy
Let be a unit vector with Schmidt decomposition , where are the Schmidt coefficients, , and , are orthonormal. Then and have the same nonzero spectrum and
Proof (6 steps)
- Step 1:Expand the outer product of the Schmidt form; the coefficients are real, so no complex conjugates appear.
- Step 2:Definition of the partial trace, , extended linearly.
- Step 3:Orthonormality of the leaves only .
- Step 4:The same computation tracing out , now using orthonormality of the .
- Step 5:Both expressions are spectral decompositions (orthonormal vectors, positive weights); any remaining eigenvalues, on the orthogonal complements of and , are zero. The two dimensions , may differ; only the number of zeros differs.
- Step 6:Zero eigenvalues contribute , so the entropies agree.
∎
Definition
Entanglement entropy
For a pure state the entanglement entropy across the cut is . For qubits and a subset of them, the simulator reports it as with the reduced state on the kept qubits (qubit is the most significant bit).
Zero entanglement entropy means product; the maximum is set by the smaller side
if and only if , and , with equality for the maximally entangled states , .
Proof (3 steps)
- Step 1:Lower-bound equality case of the bounds theorem: iff has spectrum , i.e. a single Schmidt term.
- Step 2:The are orthonormal vectors in and the are orthonormal vectors in . Applying the upper bound to restricted to its -dimensional support gives .
- Step 3:Equality case of the upper bound: a flat Schmidt spectrum. For two qubits and the four Bell states reach bit.
∎
Worked examples: a tunable pair and the GHZ state#
Circuit · 2 qubits
on qubit 0 followed by with control 0 and target 1 prepares , amplitudes .
Entanglement entropy of
- Step 1:First column of .
- Step 2:Qubit 1 starts in ; CNOT flips it exactly when qubit 0 is .
- Step 3:This is already a Schmidt decomposition: is orthonormal on both sides and the coefficients are positive for (otherwise absorb signs into the basis vectors).
- Step 4:By the theorem ; the cross terms carry the factor from qubit 1.
- Step 5:Eigenvalue formula with , which is the definition of the binary entropy.
- Step 6:Values at .
- Step 7:and .
- Step 8:Collect the rational terms.
- Step 9:.
- Step 10:gives the Bell state with one full ebit; and give the product states and .
Result
Quick check
What is the entanglement entropy , in bits, of at ?
Quick check
Evaluate the binary entropy in bits, to four decimal places.
Circuit · 3 qubits
GHZ preparation: on qubit 0, then and , giving with amplitudes on and .
Every marginal of the GHZ state carries one bit
- Step 1:Apply the three gates in order; each CNOT copies the computational value of its control into its target.
- Step 2:Expand the outer product; this is an matrix with four nonzero entries equal to at positions .
- Step 3:, applied to each of the four terms.
- Step 4:The coherences need and vanish; the remaining state is maximally mixed.
- Step 5:Trace out only qubit 2: .
- Step 6:Again the coherences vanish. In the ordered basis the matrix is diagonal.
- Step 7:A diagonal matrix displays its eigenvalues; zeros contribute nothing. Note : the pair is far from maximally mixed.
- Step 8:Same computation as for qubit 0, now with supplied by qubits .
- Step 9:Consistency check with the equal-marginal theorem: and are complementary parts of a pure state. The Schmidt form across this cut is .
Result
Check it with the engine. The cell below runs both circuits in the statevector simulator, computes the marginal entropies with entanglementEntropy, compares the first one with the closed form , and prints the diagonal of for the GHZ state.
import { entanglementEntropy, reducedStateFromPure, runStatevector, type CircuitIR } from '@/lib/quantum-simulator';
// RY(pi/3) on qubit 0, then CNOT(0 -> 1): (sqrt(3)/2)|00> + (1/2)|11>
const pair: CircuitIR = {
version: 1,
numQubits: 2,
numClbits: 0,
ops: [
{ kind: 'gate', gate: 'RY', targets: [0], params: [Math.PI / 3] },
{ kind: 'gate', gate: 'CNOT', targets: [0, 1] },
],
};
const psi = runStatevector(pair);
console.log('S(rho_0) pair =', entanglementEntropy(psi, [0]).toFixed(10));
console.log('2 - 3/4 log2 3 =', (2 - 0.75 * Math.log2(3)).toFixed(10));
// GHZ: H(0), CNOT(0 -> 1), CNOT(1 -> 2)
const ghzIR: CircuitIR = {
version: 1,
numQubits: 3,
numClbits: 0,
ops: [
{ kind: 'gate', gate: 'H', targets: [0] },
{ kind: 'gate', gate: 'CNOT', targets: [0, 1] },
{ kind: 'gate', gate: 'CNOT', targets: [1, 2] },
],
};
const ghz = runStatevector(ghzIR);
for (const keep of [[0], [0, 1], [2]]) {
console.log('S(rho_{' + keep.join(',') + '}) GHZ =', entanglementEntropy(ghz, keep).toFixed(10));
}
const rho01 = reducedStateFromPure(ghz, [0, 1]);
const diag = [0, 1, 2, 3].map((k) => rho01.data[2 * (k * 4 + k)]!.toFixed(4));
console.log('diag rho_{0,1} =', diag.join(' '));Expected output
S(rho_0) pair = 0.8112781245
2 - 3/4 log2 3 = 0.8112781245
S(rho_{0}) GHZ = 1.0000000000
S(rho_{0,1}) GHZ = 1.0000000000
S(rho_{2}) GHZ = 1.0000000000
diag rho_{0,1} = 0.5000 0.0000 0.0000 0.5000What the entropy does and does not measure#
Same marginal entropy, different global entropy
- Step 1:The global state is pure; its marginal is maximally mixed (partial-trace lesson).
- Step 2:Additivity gives ; the partial trace of a product is the first factor times the trace of the second.
- Step 3:For the Bell state the whole is less uncertain than the part, which is impossible for classical probability distributions (where ). A negative certifies entanglement; the maximally mixed state shows the classical ordering.
Quick check
A two-qubit state has bit. What can you conclude?
Where this goes next. Entanglement entropy is the currency of the rest of the course. In Stage 2 the Bell states carry exactly one ebit each, consumed by teleportation and superdense coding. In Stage 4 the entanglement entropy of the qubits inside a variational ansatz becomes a diagnostic: random deep circuits drive every small marginal towards the maximally mixed state, with close to the Page value near bits, and this volume-law entanglement is one mechanism behind barren plateaus.
References
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press (2010), §11.3 (von Neumann entropy, Theorem 11.8) and §2.5 (Schmidt decomposition).
- M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press (2017), Chapter 11 (quantum entropy and its properties).arxiv.org
- T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed., Wiley (2006), §2.6 (Jensen's inequality and Gibbs' inequality).
Hands-on labs
Hit entanglement-entropy targets
2 steps · auto-gradedOpen labCompute the entanglement entropy of a Schmidt state from its Schmidt coefficients, then prepare a three-qubit state whose marginals , and each carry exactly one bit of entropy. All entropies are in bits; qubit 0 is the leftmost bit.