QuantumCore

Lesson 15 · 60 min · core

Von Neumann & Entanglement Entropy

Loading progress…

The von Neumann entropy S(ρ)=−Tr(ρlog⁡2ρ)=−∑iλilog⁡2λiS(\rho)=-\mathrm{Tr}(\rho\log_2\rho)=-\sum_i\lambda_i\log_2\lambda_i measures, in bits, how far a density operator is from a pure state. We define it through the functional calculus, prove the bounds 0≤S(ρ)≤log⁡2d0\le S(\rho)\le\log_2 d 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 cos⁡θ2∣00⟩+sin⁡θ2∣11⟩\cos\tfrac\theta2\lvert00\rangle+\sin\tfrac\theta2\lvert11\rangle 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 S(ρ)=−∑iλilog⁡2λiS(\rho)=-\sum_i\lambda_i\log_2\lambda_i from the spectrum of ρ\rho, using the convention 0log⁡20:=00\log_20:=0 justified by lim⁡x→0+xlog⁡x=0\lim_{x\to0^+}x\log x=0.

  • Prove 0≤S(ρ)≤log⁡2d0\le S(\rho)\le\log_2d with equality exactly for pure states (lower bound) and for the maximally mixed state I/dI/d (upper bound).

  • Prove S(UρU†)=S(ρ)S(U\rho U^\dagger)=S(\rho) and S(ρA)=S(ρB)S(\rho_A)=S(\rho_B) for every pure ρAB\rho_{AB}, and use S(ρA)S(\rho_A) as the entanglement measure of pure bipartite states.

  • Evaluate S=h(cos⁡2θ2)S=h(\cos^2\tfrac\theta2) with the binary entropy h(p)=−plog⁡2p−(1−p)log⁡2(1−p)h(p)=-p\log_2p-(1-p)\log_2(1-p) and show that every one- and two-qubit marginal of the GHZ state carries exactly one bit.

definition · Von Neumann entropy
S(ρ)=−Tr(ρlog⁡2ρ)=−∑i=1dλilog⁡2λi,0log⁡20:=0S(\rho)=-\mathrm{Tr}\big(\rho\log_2\rho\big)=-\sum_{i=1}^{d}\lambda_i\log_2\lambda_i,\qquad 0\log_20:=0
theorem · Entropy bounds
0≤S(ρ)≤log⁡2d,S(ρ)=0  ⟺  ρ2=ρ,S(ρ)=log⁡2d  ⟺  ρ=I/d0\le S(\rho)\le\log_2d,\qquad S(\rho)=0\iff\rho^2=\rho,\qquad S(\rho)=\log_2d\iff\rho=I/d
identity · Unitary invariance
S(UρU†)=S(ρ)for every unitary US\big(U\rho U^\dagger\big)=S(\rho)\quad\text{for every unitary }U
theorem · Equal marginal entropies of a pure state
ρAB=∣ψ⟩⟨ψ∣ ⇒ S(ρA)=S(ρB)=−∑kλk2log⁡2λk2\rho_{AB}=\lvert\psi\rangle\langle\psi\rvert\ \Rightarrow\ S(\rho_A)=S(\rho_B)=-\sum_k\lambda_k^2\log_2\lambda_k^2
formula · Binary entropy
h(p)=−plog⁡2p−(1−p)log⁡2(1−p),h(34)=2−34log⁡23≈0.811278h(p)=-p\log_2p-(1-p)\log_2(1-p),\qquad h\big(\tfrac34\big)=2-\tfrac34\log_23\approx0.811278

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: TrB∣Φ+⟩⟨Φ+∣=I/2\mathrm{Tr}_B\lvert\Phi^+\rangle\langle\Phi^+\rvert=I/2. We now want a single number that says how mixed a density operator is. Classically, the Shannon entropy H(p)=−∑ipilog⁡2piH(p)=-\sum_ip_i\log_2p_i of a probability vector pp counts the average number of bits of missing information. A density operator ρ\rho is Hermitian, positive semidefinite and has unit trace, so by the spectral theorem it is a probability distribution {λi}\{\lambda_i\} over an orthonormal eigenbasis {∣ei⟩}\{\lvert e_i\rangle\}: ρ=∑i=1dλi∣ei⟩⟨ei∣,λi≥0,∑iλi=1.\rho=\sum_{i=1}^{d}\lambda_i\lvert e_i\rangle\langle e_i\rvert,\qquad \lambda_i\ge0,\qquad \sum_i\lambda_i=1 . The von Neumann entropy is the Shannon entropy of this spectrum. Throughout the lesson logarithms are base 22, so entropies are measured in bits; to convert to nats multiply by ln⁡2\ln2.

Definition

Von Neumann entropy

For a density operator ρ\rho on H≅Cd\mathcal H\cong\mathbb C^d, S(ρ):=−Tr(ρlog⁡2ρ)S(\rho):=-\mathrm{Tr}\big(\rho\log_2\rho\big), where ρlog⁡2ρ\rho\log_2\rho is the function η(x)=xlog⁡2x\eta(x)=x\log_2x applied to ρ\rho by the functional calculus, with η(0):=0\eta(0):=0. Equivalently S(ρ)=−∑iλilog⁡2λiS(\rho)=-\sum_i\lambda_i\log_2\lambda_i over the eigenvalues λi\lambda_i of ρ\rho.

Derivation

From the trace formula to the eigenvalue formula

  1. Step 1:
    ρ=∑i=1dλi∣ei⟩⟨ei∣,⟨ei∣ej⟩=δij\rho=\sum_{i=1}^{d}\lambda_i\lvert e_i\rangle\langle e_i\rvert,\qquad \langle e_i\vert e_j\rangle=\delta_{ij}
    Spectral theorem for the Hermitian operator ρ\rho; positivity gives λi≥0\lambda_i\ge0 and Trρ=1\mathrm{Tr}\rho=1 gives ∑iλi=1\sum_i\lambda_i=1.
  2. Step 2:
    ρlog⁡2ρ=η(ρ)=∑i=1dη(λi)∣ei⟩⟨ei∣=∑i=1dλilog⁡2λi ∣ei⟩⟨ei∣\rho\log_2\rho=\eta(\rho)=\sum_{i=1}^{d}\eta(\lambda_i)\lvert e_i\rangle\langle e_i\rvert=\sum_{i=1}^{d}\lambda_i\log_2\lambda_i\,\lvert e_i\rangle\langle e_i\rvert
    Functional calculus with η(x)=xlog⁡2x\eta(x)=x\log_2x. Applying η\eta in one go avoids forming log⁡2ρ\log_2\rho on its own, which is undefined when ρ\rho has a zero eigenvalue.
  3. Step 3:
    Tr(ρlog⁡2ρ)=∑i=1dλilog⁡2λi Tr∣ei⟩⟨ei∣=∑i=1dλilog⁡2λi ⟨ei∣ei⟩\mathrm{Tr}\big(\rho\log_2\rho\big)=\sum_{i=1}^{d}\lambda_i\log_2\lambda_i\,\mathrm{Tr}\lvert e_i\rangle\langle e_i\rvert=\sum_{i=1}^{d}\lambda_i\log_2\lambda_i\,\langle e_i\vert e_i\rangle
    Linearity of the trace and Tr∣a⟩⟨b∣=⟨b∣a⟩\mathrm{Tr}\lvert a\rangle\langle b\rvert=\langle b\vert a\rangle.
  4. Step 4:
    S(ρ)=−∑i=1dλilog⁡2λiS(\rho)=-\sum_{i=1}^{d}\lambda_i\log_2\lambda_i
    Each ⟨ei∣ei⟩=1\langle e_i\vert e_i\rangle=1; multiply by −1-1.

Result

S(ρ)=H(λ1,…,λd) (the Shannon entropy of the spectrum)\boxed{S(\rho)=H(\lambda_1,\dots,\lambda_d)\ \text{(the Shannon entropy of the spectrum)}}
Derivation

Why 0log⁡20:=00\log_20:=0: the limit lim⁡x→0+xlog⁡2x=0\lim_{x\to0^+}x\log_2x=0

  1. Step 1:
    xlog⁡2x=xln⁡xln⁡2x\log_2x=\frac{x\ln x}{\ln2}
    Change of base, log⁡2x=ln⁡x/ln⁡2\log_2x=\ln x/\ln2; the constant factor does not affect the limit.
  2. Step 2:
    lim⁡x→0+xln⁡x=lim⁡x→0+ln⁡x1/x\lim_{x\to0^+}x\ln x=\lim_{x\to0^+}\frac{\ln x}{1/x}
    Rewrite the indeterminate form 0⋅(−∞)0\cdot(-\infty) as the quotient −∞+∞\tfrac{-\infty}{+\infty}, to which L'Hôpital's rule applies.
  3. Step 3:
    =lim⁡x→0+(ln⁡x)′(1/x)′=lim⁡x→0+1/x−1/x2=\lim_{x\to0^+}\frac{(\ln x)'}{(1/x)'}=\lim_{x\to0^+}\frac{1/x}{-1/x^2}
    L'Hôpital: numerator and denominator are differentiable on (0,1)(0,1), both diverge, and the derivative of the denominator, −1/x2-1/x^2, never vanishes there.
  4. Step 4:
    =lim⁡x→0+(−x)=0=\lim_{x\to0^+}(-x)=0
    Simplify 1/x−1/x2=−x\frac{1/x}{-1/x^2}=-x.
  5. Step 5:
    η(x)=xlog⁡2x on (0,1],η(0):=0 ⇒ η∈C([0,1])\eta(x)=x\log_2x\ \text{on }(0,1],\quad \eta(0):=0\ \Rightarrow\ \eta\in C\big([0,1]\big)
    Defining η(0)\eta(0) as the limit makes η\eta continuous on the closed interval, so SS is a continuous function of the eigenvalues and zero-probability eigenvectors contribute nothing.

First examples. A pure state ρ=∣ψ⟩⟨ψ∣\rho=\lvert\psi\rangle\langle\psi\rvert has spectrum {1,0,…,0}\{1,0,\dots,0\}, so S=−1⋅log⁡21−0=0S=-1\cdot\log_21-0=0. The single-qubit maximally mixed state I/2I/2 has spectrum {12,12}\{\tfrac12,\tfrac12\} and S=−2⋅12log⁡212=1S=-2\cdot\tfrac12\log_2\tfrac12=1 bit. The qubit state ρ=34∣0⟩⟨0∣+14∣1⟩⟨1∣\rho=\tfrac34\lvert0\rangle\langle0\rvert+\tfrac14\lvert1\rangle\langle1\rvert has S=−34log⁡234−14log⁡214≈0.8113S=-\tfrac34\log_2\tfrac34-\tfrac14\log_2\tfrac14\approx0.8113 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 ∣+⟩⟨+∣=12(1111)\lvert+\rangle\langle+\rvert=\tfrac12\begin{pmatrix}1&1\\1&1\end{pmatrix} has diagonal (12,12)(\tfrac12,\tfrac12) but eigenvalues {1,0}\{1,0\}, so S(∣+⟩⟨+∣)=0S(\lvert+\rangle\langle+\rvert)=0, not 11.

Definition

Binary entropy

For p∈[0,1]p\in[0,1], h(p):=−plog⁡2p−(1−p)log⁡2(1−p)h(p):=-p\log_2p-(1-p)\log_2(1-p) with 0log⁡20:=00\log_20:=0. Every qubit density operator with eigenvalues {p,1−p}\{p,1-p\} has S(ρ)=h(p)S(\rho)=h(p). The function is symmetric, h(p)=h(1−p)h(p)=h(1-p), satisfies h(0)=h(1)=0h(0)=h(1)=0, and has derivative h′(p)=log⁡21−pph'(p)=\log_2\frac{1-p}{p}, which vanishes only at p=12p=\tfrac12 where hh attains its maximum h(12)=1h(\tfrac12)=1.

Bounds and unitary invariance#

Theorem

Entropy bounds 0≤S(ρ)≤log⁡2d0\le S(\rho)\le\log_2d

For every density operator ρ\rho on Cd\mathbb C^d, 0≤S(ρ)≤log⁡2d0\le S(\rho)\le\log_2d. The lower bound is attained exactly for pure states and the upper bound exactly for the maximally mixed state ρ=I/d\rho=I/d.

Proof (10 steps)
  1. Step 1:
    0≤λi≤1 ⇒ log⁡2λi≤0 (λi>0) ⇒ −λilog⁡2λi≥00\le\lambda_i\le1\ \Rightarrow\ \log_2\lambda_i\le0\ (\lambda_i>0)\ \Rightarrow\ -\lambda_i\log_2\lambda_i\ge0
    Each eigenvalue is non-negative and they sum to one, so none exceeds one. Terms with λi=0\lambda_i=0 are zero by the convention 0log⁡20=00\log_20=0.
  2. Step 2:
    S(ρ)=∑i(−λilog⁡2λi)≥0S(\rho)=\sum_i\big(-\lambda_i\log_2\lambda_i\big)\ge0
    A sum of non-negative terms is non-negative: the lower bound holds termwise.
  3. Step 3:
    S(ρ)=0  ⟺  λi∈{0,1} ∀i  ⟺  spec ρ={1,0,…,0}  ⟺  ρ=∣e1⟩⟨e1∣S(\rho)=0\iff\lambda_i\in\{0,1\}\ \forall i\iff\mathrm{spec}\,\rho=\{1,0,\dots,0\}\iff\rho=\lvert e_1\rangle\langle e_1\rvert
    −xlog⁡2x=0-x\log_2x=0 on [0,1][0,1] only at x∈{0,1}x\in\{0,1\}; with ∑iλi=1\sum_i\lambda_i=1 exactly one eigenvalue equals one, so ρ\rho is a rank-one projector, i.e. pure.
  4. Step 4:
    P:={i:λi>0},r:=∣P∣=rank⁡ρ≤d,∑i∈Pλi=1P:=\{i:\lambda_i>0\},\quad r:=\lvert P\rvert=\operatorname{rank}\rho\le d,\qquad \sum_{i\in P}\lambda_i=1
    For the upper bound restrict every sum to the nonzero eigenvalues; the dropped terms are zero.
  5. Step 5:
    S(ρ)−log⁡2d=∑i∈Pλilog⁡21λi−∑i∈Pλilog⁡2d=∑i∈Pλilog⁡21/dλiS(\rho)-\log_2d=\sum_{i\in P}\lambda_i\log_2\frac1{\lambda_i}-\sum_{i\in P}\lambda_i\log_2d=\sum_{i\in P}\lambda_i\log_2\frac{1/d}{\lambda_i}
    Write log⁡2d=∑i∈Pλilog⁡2d\log_2d=\sum_{i\in P}\lambda_i\log_2d (the weights sum to one) and combine the logarithms: log⁡21λi−log⁡2d=log⁡21/dλi\log_2\frac1{\lambda_i}-\log_2d=\log_2\frac{1/d}{\lambda_i}. This is Gibbs' inequality in the making.
  6. Step 6:
    ∑i∈Pλilog⁡21/dλi≤log⁡2(∑i∈Pλi 1/dλi)\sum_{i\in P}\lambda_i\log_2\frac{1/d}{\lambda_i}\le\log_2\Big(\sum_{i\in P}\lambda_i\,\frac{1/d}{\lambda_i}\Big)
    Jensen's inequality for the concave function log⁡2\log_2 with probability weights λi\lambda_i, i∈Pi\in P, at the points xi=1/dλi>0x_i=\frac{1/d}{\lambda_i}>0: ∑iλilog⁡2xi≤log⁡2∑iλixi\sum_i\lambda_i\log_2x_i\le\log_2\sum_i\lambda_ix_i.
  7. Step 7:
    =log⁡2(∑i∈P1d)=log⁡2rd≤log⁡21=0=\log_2\Big(\sum_{i\in P}\frac1d\Big)=\log_2\frac rd\le\log_21=0
    Each summand collapses to 1d\frac1d, there are rr of them, and r≤dr\le d makes rd≤1\frac rd\le1, whose logarithm is at most log⁡21=0\log_21=0.
  8. Step 8:
    S(ρ)≤log⁡2dS(\rho)\le\log_2d
    Combine the three previous lines.
  9. Step 9:
    S(ρ)=log⁡2d  ⟺  xi=const (i∈P) and r=d  ⟺  λi=1d ∀iS(\rho)=\log_2d\iff x_i=\text{const}\ (i\in P)\ \text{and}\ r=d\iff\lambda_i=\tfrac1d\ \forall i
    Equality in Jensen for the strictly concave log⁡2\log_2 forces all xi=1/dλix_i=\frac{1/d}{\lambda_i} to be equal, i.e. the λi\lambda_i are equal on PP; equality in log⁡2rd≤0\log_2\frac rd\le0 forces r=dr=d. Together λi=1d\lambda_i=\frac1d for all dd eigenvalues.
  10. Step 10:
    ρ=∑i=1d1d∣ei⟩⟨ei∣=1dI,S(Id)=−d⋅1dlog⁡21d=log⁡2d\rho=\sum_{i=1}^{d}\tfrac1d\lvert e_i\rangle\langle e_i\rvert=\tfrac1dI,\qquad S\big(\tfrac Id\big)=-d\cdot\tfrac1d\log_2\tfrac1d=\log_2d
    Completeness ∑i∣ei⟩⟨ei∣=I\sum_i\lvert e_i\rangle\langle e_i\rvert=I gives the unique maximiser, and the direct evaluation confirms it attains the bound.

∎

Proposition

Unitary invariance S(UρU†)=S(ρ)S(U\rho U^\dagger)=S(\rho)

For every density operator ρ\rho and every unitary UU on the same space, S(UρU†)=S(ρ)S(U\rho U^\dagger)=S(\rho). In particular the entropy depends only on the spectrum of ρ\rho, not on the basis, and closed-system evolution ρ↦e−iHtρ eiHt\rho\mapsto e^{-iHt}\rho\,e^{iHt} never changes it.

Proof (5 steps)
  1. Step 1:
    UρU†=∑iλi U∣ei⟩⟨ei∣U†=∑iλi∣fi⟩⟨fi∣,∣fi⟩:=U∣ei⟩U\rho U^\dagger=\sum_i\lambda_i\,U\lvert e_i\rangle\langle e_i\rvert U^\dagger=\sum_i\lambda_i\lvert f_i\rangle\langle f_i\rvert,\qquad \lvert f_i\rangle:=U\lvert e_i\rangle
    Conjugate the spectral decomposition term by term; (U∣ei⟩)†=⟨ei∣U†(U\lvert e_i\rangle)^\dagger=\langle e_i\rvert U^\dagger.
  2. Step 2:
    ⟨fi∣fj⟩=⟨ei∣U†U∣ej⟩=⟨ei∣ej⟩=δij\langle f_i\vert f_j\rangle=\langle e_i\vert U^\dagger U\vert e_j\rangle=\langle e_i\vert e_j\rangle=\delta_{ij}
    U†U=IU^\dagger U=I: the rotated eigenvectors are again orthonormal, so the line above is a spectral decomposition of UρU†U\rho U^\dagger.
  3. Step 3:
    spec(UρU†)=spec(ρ)={λ1,…,λd}\mathrm{spec}\big(U\rho U^\dagger\big)=\mathrm{spec}(\rho)=\{\lambda_1,\dots,\lambda_d\}
    Same eigenvalues, different eigenvectors.
  4. Step 4:
    S(UρU†)=−∑iλilog⁡2λi=S(ρ)S\big(U\rho U^\dagger\big)=-\sum_i\lambda_i\log_2\lambda_i=S(\rho)
    The eigenvalue formula only sees the spectrum.
  5. Step 5:
    alternatively:  η(UρU†)=Uη(ρ)U† ⇒ Tr(Uη(ρ)U†)=Tr(η(ρ)U†U)=Tr η(ρ)\text{alternatively: }\ \eta(U\rho U^\dagger)=U\eta(\rho)U^\dagger\ \Rightarrow\ \mathrm{Tr}\big(U\eta(\rho)U^\dagger\big)=\mathrm{Tr}\big(\eta(\rho)U^\dagger U\big)=\mathrm{Tr}\,\eta(\rho)
    The functional calculus commutes with unitary conjugation (apply it to the decomposition in the first line), and the trace is cyclic.

∎

Derivation

Additivity on product states S(ρA⊗ρB)=S(ρA)+S(ρB)S(\rho_A\otimes\rho_B)=S(\rho_A)+S(\rho_B)

  1. Step 1:
    ρA=∑iμi∣ai⟩⟨ai∣,ρB=∑jνj∣bj⟩⟨bj∣ ⇒ ρA⊗ρB=∑i,jμiνj∣aibj⟩⟨aibj∣\rho_A=\sum_i\mu_i\lvert a_i\rangle\langle a_i\rvert,\quad \rho_B=\sum_j\nu_j\lvert b_j\rangle\langle b_j\rvert\ \Rightarrow\ \rho_A\otimes\rho_B=\sum_{i,j}\mu_i\nu_j\lvert a_ib_j\rangle\langle a_ib_j\rvert
    Kronecker product of the two spectral decompositions; {∣aibj⟩}\{\lvert a_ib_j\rangle\} is an orthonormal basis of HA⊗HB\mathcal H_A\otimes\mathcal H_B, so the eigenvalues are the products μiνj\mu_i\nu_j.
  2. Step 2:
    S(ρA⊗ρB)=−∑i,jμiνjlog⁡2(μiνj)=−∑i,jμiνj(log⁡2μi+log⁡2νj)S(\rho_A\otimes\rho_B)=-\sum_{i,j}\mu_i\nu_j\log_2(\mu_i\nu_j)=-\sum_{i,j}\mu_i\nu_j\big(\log_2\mu_i+\log_2\nu_j\big)
    Eigenvalue formula and log⁡2(ab)=log⁡2a+log⁡2b\log_2(ab)=\log_2a+\log_2b (terms with μiνj=0\mu_i\nu_j=0 vanish on both sides).
  3. Step 3:
    =−(∑jνj)∑iμilog⁡2μi−(∑iμi)∑jνjlog⁡2νj=S(ρA)+S(ρB)=-\Big(\sum_j\nu_j\Big)\sum_i\mu_i\log_2\mu_i-\Big(\sum_i\mu_i\Big)\sum_j\nu_j\log_2\nu_j=S(\rho_A)+S(\rho_B)
    Factor the double sums and use ∑iμi=∑jνj=1\sum_i\mu_i=\sum_j\nu_j=1.

Result

S(I4)=S(I2⊗I2)=1+1=2=log⁡24\boxed{S\big(\tfrac I4\big)=S\big(\tfrac I2\otimes\tfrac I2\big)=1+1=2=\log_24}
RY(π/3)=(cos⁡π6−sin⁡π6sin⁡π6cos⁡π6)=(32−121232)R_Y(\pi/3)=\begin{pmatrix}\cos\frac\pi6&-\sin\frac\pi6\\\sin\frac\pi6&\cos\frac\pi6\end{pmatrix}=\begin{pmatrix}\frac{\sqrt3}{2}&-\frac12\\\frac12&\frac{\sqrt3}{2}\end{pmatrix}
R_Y(π/3), the gate that prepares the unequal Schmidt coefficients2×2

Unitary verified: U†U=IU^\dagger U = I (max deviation 0.0e+0)

Entanglement entropy of pure bipartite states#

A pure global state ∣ψ⟩AB\lvert\psi\rangle_{AB} has S(ρAB)=0S(\rho_{AB})=0: there is nothing unknown about the whole. Yet its parts may be mixed. For ∣Φ+⟩\lvert\Phi^+\rangle each qubit alone is I/2I/2 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.

Theorem

Both marginals of a pure state have the same entropy

Let ∣ψ⟩∈HA⊗HB\lvert\psi\rangle\in\mathcal H_A\otimes\mathcal H_B be a unit vector with Schmidt decomposition ∣ψ⟩=∑k=1rλk∣ak⟩∣bk⟩\lvert\psi\rangle=\sum_{k=1}^{r}\lambda_k\lvert a_k\rangle\lvert b_k\rangle, where λk>0\lambda_k>0 are the Schmidt coefficients, ∑kλk2=1\sum_k\lambda_k^2=1, and {∣ak⟩}\{\lvert a_k\rangle\}, {∣bk⟩}\{\lvert b_k\rangle\} are orthonormal. Then ρA\rho_A and ρB\rho_B have the same nonzero spectrum {λk2}\{\lambda_k^2\} and S(ρA)=S(ρB)=−∑k=1rλk2log⁡2λk2.S(\rho_A)=S(\rho_B)=-\sum_{k=1}^{r}\lambda_k^2\log_2\lambda_k^2 .

Proof (6 steps)
  1. Step 1:
    ρAB=∣ψ⟩⟨ψ∣=∑k,l=1rλkλl ∣ak⟩⟨al∣⊗∣bk⟩⟨bl∣\rho_{AB}=\lvert\psi\rangle\langle\psi\rvert=\sum_{k,l=1}^{r}\lambda_k\lambda_l\,\lvert a_k\rangle\langle a_l\rvert\otimes\lvert b_k\rangle\langle b_l\rvert
    Expand the outer product of the Schmidt form; the coefficients are real, so no complex conjugates appear.
  2. Step 2:
    ρA=TrB ρAB=∑k,lλkλl ∣ak⟩⟨al∣ Tr∣bk⟩⟨bl∣=∑k,lλkλl ∣ak⟩⟨al∣ ⟨bl∣bk⟩\rho_A=\mathrm{Tr}_B\,\rho_{AB}=\sum_{k,l}\lambda_k\lambda_l\,\lvert a_k\rangle\langle a_l\rvert\,\mathrm{Tr}\lvert b_k\rangle\langle b_l\rvert=\sum_{k,l}\lambda_k\lambda_l\,\lvert a_k\rangle\langle a_l\rvert\,\langle b_l\vert b_k\rangle
    Definition of the partial trace, TrB(X⊗Y)=X TrY\mathrm{Tr}_B(X\otimes Y)=X\,\mathrm{Tr}Y, extended linearly.
  3. Step 3:
    =∑k,lλkλl δkl∣ak⟩⟨al∣=∑k=1rλk2∣ak⟩⟨ak∣=\sum_{k,l}\lambda_k\lambda_l\,\delta_{kl}\lvert a_k\rangle\langle a_l\rvert=\sum_{k=1}^{r}\lambda_k^2\lvert a_k\rangle\langle a_k\rvert
    Orthonormality of the ∣bk⟩\lvert b_k\rangle leaves only k=lk=l.
  4. Step 4:
    ρB=TrA ρAB=∑k,lλkλl ⟨al∣ak⟩∣bk⟩⟨bl∣=∑k=1rλk2∣bk⟩⟨bk∣\rho_B=\mathrm{Tr}_A\,\rho_{AB}=\sum_{k,l}\lambda_k\lambda_l\,\langle a_l\vert a_k\rangle\lvert b_k\rangle\langle b_l\rvert=\sum_{k=1}^{r}\lambda_k^2\lvert b_k\rangle\langle b_k\rvert
    The same computation tracing out AA, now using orthonormality of the ∣ak⟩\lvert a_k\rangle.
  5. Step 5:
    spec≠0(ρA)=spec≠0(ρB)={λ12,…,λr2}\mathrm{spec}_{\ne0}(\rho_A)=\mathrm{spec}_{\ne0}(\rho_B)=\{\lambda_1^2,\dots,\lambda_r^2\}
    Both expressions are spectral decompositions (orthonormal vectors, positive weights); any remaining eigenvalues, on the orthogonal complements of span{∣ak⟩}\mathrm{span}\{\lvert a_k\rangle\} and span{∣bk⟩}\mathrm{span}\{\lvert b_k\rangle\}, are zero. The two dimensions dAd_A, dBd_B may differ; only the number of zeros differs.
  6. Step 6:
    S(ρA)=−∑k=1rλk2log⁡2λk2=S(ρB)S(\rho_A)=-\sum_{k=1}^{r}\lambda_k^2\log_2\lambda_k^2=S(\rho_B)
    Zero eigenvalues contribute 0log⁡20=00\log_20=0, so the entropies agree.

∎

Definition

Entanglement entropy

For a pure state ∣ψ⟩AB\lvert\psi\rangle_{AB} the entanglement entropy across the cut A∣BA\vert B is E(ψ):=S(ρA)=S(ρB)E(\psi):=S(\rho_A)=S(\rho_B). For nn qubits and a subset AA of them, the simulator reports it as S(ρA)S(\rho_A) with ρA\rho_A the reduced state on the kept qubits AA (qubit 00 is the most significant bit).

Corollary

Zero entanglement entropy means product; the maximum is set by the smaller side

E(ψ)=0E(\psi)=0 if and only if ∣ψ⟩=∣α⟩A⊗∣β⟩B\lvert\psi\rangle=\lvert\alpha\rangle_A\otimes\lvert\beta\rangle_B, and E(ψ)≤log⁡2min⁡(dA,dB)E(\psi)\le\log_2\min(d_A,d_B), with equality for the maximally entangled states λk=1/d\lambda_k=1/\sqrt{d}, d=min⁡(dA,dB)d=\min(d_A,d_B).

Proof (3 steps)
  1. Step 1:
    E(ψ)=0  ⟺  ρA pure  ⟺  r=1  ⟺  ∣ψ⟩=λ1∣a1⟩∣b1⟩, λ1=1E(\psi)=0\iff\rho_A\ \text{pure}\iff r=1\iff\lvert\psi\rangle=\lambda_1\lvert a_1\rangle\lvert b_1\rangle,\ \lambda_1=1
    Lower-bound equality case of the bounds theorem: S(ρA)=0S(\rho_A)=0 iff ρA\rho_A has spectrum {1,0,… }\{1,0,\dots\}, i.e. a single Schmidt term.
  2. Step 2:
    r≤min⁡(dA,dB) ⇒ E(ψ)=S(ρA)≤log⁡2r≤log⁡2min⁡(dA,dB)r\le\min(d_A,d_B)\ \Rightarrow\ E(\psi)=S(\rho_A)\le\log_2r\le\log_2\min(d_A,d_B)
    The ∣ak⟩\lvert a_k\rangle are rr orthonormal vectors in HA\mathcal H_A and the ∣bk⟩\lvert b_k\rangle are rr orthonormal vectors in HB\mathcal H_B. Applying the upper bound to ρA\rho_A restricted to its rr-dimensional support gives S≤log⁡2rS\le\log_2r.
  3. Step 3:
    λk2=1d (k=1,…,d) ⇒ E=−d⋅1dlog⁡21d=log⁡2d\lambda_k^2=\tfrac1d\ (k=1,\dots,d)\ \Rightarrow\ E=-d\cdot\tfrac1d\log_2\tfrac1d=\log_2d
    Equality case of the upper bound: a flat Schmidt spectrum. For two qubits d=2d=2 and the four Bell states reach E=1E=1 bit.

∎

Worked examples: a tunable pair and the GHZ state#

Circuit · 2 qubits

Quantum circuit on 2 qubitsRY(π/3) on q0; X on q1 controlled by q0q0q1RY(π/3)

RY(π/3)R_Y(\pi/3) on qubit 0 followed by CNOT\mathrm{CNOT} with control 0 and target 1 prepares 32∣00⟩+12∣11⟩\tfrac{\sqrt3}{2}\lvert00\rangle+\tfrac12\lvert11\rangle, amplitudes (0.8660,0,0,0.5)(0.8660,0,0,0.5).

∣ψ⟩=32∣00⟩+12∣11⟩\lvert\psi\rangle = \tfrac{\sqrt{3}}{2}\lvert 00\rangle + \tfrac{1}{2}\lvert 11\rangle
Derivation

Entanglement entropy of cos⁡θ2∣00⟩+sin⁡θ2∣11⟩\cos\tfrac\theta2\lvert00\rangle+\sin\tfrac\theta2\lvert11\rangle

  1. Step 1:
    RY(θ)∣0⟩=cos⁡θ2∣0⟩+sin⁡θ2∣1⟩R_Y(\theta)\lvert0\rangle=\cos\tfrac\theta2\lvert0\rangle+\sin\tfrac\theta2\lvert1\rangle
    First column of RY(θ)=(cos⁡θ2−sin⁡θ2sin⁡θ2cos⁡θ2)R_Y(\theta)=\begin{pmatrix}\cos\frac\theta2&-\sin\frac\theta2\\\sin\frac\theta2&\cos\frac\theta2\end{pmatrix}.
  2. Step 2:
    CNOT0→1(cos⁡θ2∣00⟩+sin⁡θ2∣10⟩)=cos⁡θ2∣00⟩+sin⁡θ2∣11⟩=:∣ψθ⟩\mathrm{CNOT}_{0\to1}\Big(\cos\tfrac\theta2\lvert00\rangle+\sin\tfrac\theta2\lvert10\rangle\Big)=\cos\tfrac\theta2\lvert00\rangle+\sin\tfrac\theta2\lvert11\rangle=:\lvert\psi_\theta\rangle
    Qubit 1 starts in ∣0⟩\lvert0\rangle; CNOT flips it exactly when qubit 0 is ∣1⟩\lvert1\rangle.
  3. Step 3:
    ∣ψθ⟩=λ0∣0⟩∣0⟩+λ1∣1⟩∣1⟩,λ0=cos⁡θ2, λ1=sin⁡θ2(0<θ<π)\lvert\psi_\theta\rangle=\lambda_0\lvert0\rangle\lvert0\rangle+\lambda_1\lvert1\rangle\lvert1\rangle,\qquad \lambda_0=\cos\tfrac\theta2,\ \lambda_1=\sin\tfrac\theta2\quad(0<\theta<\pi)
    This is already a Schmidt decomposition: {∣0⟩,∣1⟩}\{\lvert0\rangle,\lvert1\rangle\} is orthonormal on both sides and the coefficients are positive for 0<θ<π0<\theta<\pi (otherwise absorb signs into the basis vectors).
  4. Step 4:
    ρ0=Tr1∣ψθ⟩⟨ψθ∣=(cos⁡2θ200sin⁡2θ2)\rho_0=\mathrm{Tr}_1\lvert\psi_\theta\rangle\langle\psi_\theta\rvert=\begin{pmatrix}\cos^2\frac\theta2&0\\0&\sin^2\frac\theta2\end{pmatrix}
    By the theorem ρA=∑kλk2∣ak⟩⟨ak∣\rho_A=\sum_k\lambda_k^2\lvert a_k\rangle\langle a_k\rvert; the cross terms ∣0⟩⟨1∣\lvert0\rangle\langle1\rvert carry the factor ⟨1∣0⟩=0\langle1\vert0\rangle=0 from qubit 1.
  5. Step 5:
    E(ψθ)=−cos⁡2θ2log⁡2cos⁡2θ2−sin⁡2θ2log⁡2sin⁡2θ2=h(cos⁡2θ2)E(\psi_\theta)=-\cos^2\tfrac\theta2\log_2\cos^2\tfrac\theta2-\sin^2\tfrac\theta2\log_2\sin^2\tfrac\theta2=h\big(\cos^2\tfrac\theta2\big)
    Eigenvalue formula with sin⁡2θ2=1−cos⁡2θ2\sin^2\tfrac\theta2=1-\cos^2\tfrac\theta2, which is the definition of the binary entropy.
  6. Step 6:
    θ=π3:cos⁡2π6=(32)2=34,sin⁡2π6=14\theta=\tfrac\pi3:\quad \cos^2\tfrac\pi6=\Big(\tfrac{\sqrt3}{2}\Big)^2=\tfrac34,\qquad \sin^2\tfrac\pi6=\tfrac14
    Values at θ/2=π/6\theta/2=\pi/6.
  7. Step 7:
    h(34)=−34log⁡234−14log⁡214=−34(log⁡23−2)−14(−2)h\big(\tfrac34\big)=-\tfrac34\log_2\tfrac34-\tfrac14\log_2\tfrac14=-\tfrac34\big(\log_23-2\big)-\tfrac14(-2)
    log⁡234=log⁡23−log⁡24=log⁡23−2\log_2\tfrac34=\log_23-\log_24=\log_23-2 and log⁡214=−2\log_2\tfrac14=-2.
  8. Step 8:
    =−34log⁡23+32+12=2−34log⁡23=-\tfrac34\log_23+\tfrac32+\tfrac12=2-\tfrac34\log_23
    Collect the rational terms.
  9. Step 9:
    =2−34×1.584962500721156=2−1.188721875540867=0.811278124459133=2-\tfrac34\times1.584962500721156=2-1.188721875540867=0.811278124459133
    log⁡23≈1.584962500721156\log_23\approx1.584962500721156.
  10. Step 10:
    θ=π2: h(12)=−2⋅12log⁡212=1;θ∈{0,π}: h(1)=h(0)=0\theta=\tfrac\pi2:\ h\big(\tfrac12\big)=-2\cdot\tfrac12\log_2\tfrac12=1;\qquad \theta\in\{0,\pi\}:\ h(1)=h(0)=0
    θ=π/2\theta=\pi/2 gives the Bell state ∣Φ+⟩\lvert\Phi^+\rangle with one full ebit; θ=0\theta=0 and θ=π\theta=\pi give the product states ∣00⟩\lvert00\rangle and ∣11⟩\lvert11\rangle.

Result

E(ψπ/3)=h(34)=2−34log⁡23=0.8112781244591328 bits\boxed{E(\psi_{\pi/3})=h\big(\tfrac34\big)=2-\tfrac34\log_23=0.8112781244591328\ \text{bits}}

Quick check

What is the entanglement entropy S(ρ0)S(\rho_0), in bits, of cos⁡θ2∣00⟩+sin⁡θ2∣11⟩\cos\tfrac\theta2\lvert00\rangle+\sin\tfrac\theta2\lvert11\rangle at θ=π/2\theta=\pi/2?

tolerance ±0.001

Quick check

Evaluate the binary entropy h(34)h(\tfrac34) in bits, to four decimal places.

tolerance ±0.001

Circuit · 3 qubits

Quantum circuit on 3 qubitsH on q0; X on q1 controlled by q0; X on q2 controlled by q1q0q1q2H

GHZ preparation: HH on qubit 0, then CNOT0→1\mathrm{CNOT}_{0\to1} and CNOT1→2\mathrm{CNOT}_{1\to2}, giving 12(∣000⟩+∣111⟩)\tfrac1{\sqrt2}(\lvert000\rangle+\lvert111\rangle) with amplitudes 0.70710.7071 on ∣000⟩\lvert000\rangle and ∣111⟩\lvert111\rangle.

∣ψ⟩=12∣000⟩+12∣111⟩\lvert\psi\rangle = \tfrac{1}{\sqrt{2}}\lvert 000\rangle + \tfrac{1}{\sqrt{2}}\lvert 111\rangle
Derivation

Every marginal of the GHZ state carries one bit

  1. Step 1:
    H0: ∣000⟩↦12(∣000⟩+∣100⟩) →CNOT0→1 12(∣000⟩+∣110⟩) →CNOT1→2 12(∣000⟩+∣111⟩)H_0:\ \lvert000\rangle\mapsto\tfrac1{\sqrt2}\big(\lvert000\rangle+\lvert100\rangle\big)\ \xrightarrow{\mathrm{CNOT}_{0\to1}}\ \tfrac1{\sqrt2}\big(\lvert000\rangle+\lvert110\rangle\big)\ \xrightarrow{\mathrm{CNOT}_{1\to2}}\ \tfrac1{\sqrt2}\big(\lvert000\rangle+\lvert111\rangle\big)
    Apply the three gates in order; each CNOT copies the computational value of its control into its target.
  2. Step 2:
    ρ=∣GHZ⟩⟨GHZ∣=12(∣000⟩⟨000∣+∣000⟩⟨111∣+∣111⟩⟨000∣+∣111⟩⟨111∣)\rho=\lvert\mathrm{GHZ}\rangle\langle\mathrm{GHZ}\rvert=\tfrac12\big(\lvert000\rangle\langle000\rvert+\lvert000\rangle\langle111\rvert+\lvert111\rangle\langle000\rvert+\lvert111\rangle\langle111\rvert\big)
    Expand the outer product; this is an 8×88\times8 matrix with four nonzero entries equal to 12\tfrac12 at positions (0,0),(0,7),(7,0),(7,7)(0,0),(0,7),(7,0),(7,7).
  3. Step 3:
    ρ{0}=Tr12ρ=12(∣0⟩⟨0∣⟨00∣00⟩+∣0⟩⟨1∣⟨11∣00⟩+∣1⟩⟨0∣⟨00∣11⟩+∣1⟩⟨1∣⟨11∣11⟩)\rho_{\{0\}}=\mathrm{Tr}_{12}\rho=\tfrac12\big(\lvert0\rangle\langle0\rvert\langle00\vert00\rangle+\lvert0\rangle\langle1\rvert\langle11\vert00\rangle+\lvert1\rangle\langle0\rvert\langle00\vert11\rangle+\lvert1\rangle\langle1\rvert\langle11\vert11\rangle\big)
    Tr12(∣a bc⟩⟨a′ b′c′∣)=∣a⟩⟨a′∣ ⟨b′c′∣bc⟩\mathrm{Tr}_{12}(\lvert a\,bc\rangle\langle a'\,b'c'\rvert)=\lvert a\rangle\langle a'\rvert\,\langle b'c'\vert bc\rangle, applied to each of the four terms.
  4. Step 4:
    =12(∣0⟩⟨0∣+∣1⟩⟨1∣)=I2,S(ρ{0})=h(12)=1=\tfrac12\big(\lvert0\rangle\langle0\rvert+\lvert1\rangle\langle1\rvert\big)=\tfrac I2,\qquad S(\rho_{\{0\}})=h\big(\tfrac12\big)=1
    The coherences need ⟨11∣00⟩=0\langle11\vert00\rangle=0 and vanish; the remaining state is maximally mixed.
  5. Step 5:
    ρ{0,1}=Tr2ρ=12(∣00⟩⟨00∣⟨0∣0⟩+∣00⟩⟨11∣⟨1∣0⟩+∣11⟩⟨00∣⟨0∣1⟩+∣11⟩⟨11∣⟨1∣1⟩)\rho_{\{0,1\}}=\mathrm{Tr}_{2}\rho=\tfrac12\big(\lvert00\rangle\langle00\rvert\langle0\vert0\rangle+\lvert00\rangle\langle11\rvert\langle1\vert0\rangle+\lvert11\rangle\langle00\rvert\langle0\vert1\rangle+\lvert11\rangle\langle11\rvert\langle1\vert1\rangle\big)
    Trace out only qubit 2: Tr2(∣ab c⟩⟨a′b′ c′∣)=∣ab⟩⟨a′b′∣ ⟨c′∣c⟩\mathrm{Tr}_2(\lvert ab\,c\rangle\langle a'b'\,c'\rvert)=\lvert ab\rangle\langle a'b'\rvert\,\langle c'\vert c\rangle.
  6. Step 6:
    =12(∣00⟩⟨00∣+∣11⟩⟨11∣)=diag(12,0,0,12)=\tfrac12\big(\lvert00\rangle\langle00\rvert+\lvert11\rangle\langle11\rvert\big)=\mathrm{diag}\big(\tfrac12,0,0,\tfrac12\big)
    Again the coherences vanish. In the ordered basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩\lvert00\rangle,\lvert01\rangle,\lvert10\rangle,\lvert11\rangle the matrix is diagonal.
  7. Step 7:
    spec ρ{0,1}={12,12,0,0} ⇒ S(ρ{0,1})=−2⋅12log⁡212−0−0=1\mathrm{spec}\,\rho_{\{0,1\}}=\big\{\tfrac12,\tfrac12,0,0\big\}\ \Rightarrow\ S(\rho_{\{0,1\}})=-2\cdot\tfrac12\log_2\tfrac12-0-0=1
    A diagonal matrix displays its eigenvalues; zeros contribute nothing. Note 1<log⁡24=21<\log_24=2: the pair is far from maximally mixed.
  8. Step 8:
    ρ{2}=Tr01ρ=12(∣0⟩⟨0∣+∣1⟩⟨1∣)=I2,S(ρ{2})=1\rho_{\{2\}}=\mathrm{Tr}_{01}\rho=\tfrac12\big(\lvert0\rangle\langle0\rvert+\lvert1\rangle\langle1\rvert\big)=\tfrac I2,\qquad S(\rho_{\{2\}})=1
    Same computation as for qubit 0, now with ⟨ab∣a′b′⟩\langle ab\vert a'b'\rangle supplied by qubits 0,10,1.
  9. Step 9:
    S(ρ{0,1})=S(ρ{2})=1S(\rho_{\{0,1\}})=S(\rho_{\{2\}})=1
    Consistency check with the equal-marginal theorem: {0,1}\{0,1\} and {2}\{2\} are complementary parts of a pure state. The Schmidt form across this cut is 12∣00⟩∣0⟩+12∣11⟩∣1⟩\tfrac1{\sqrt2}\lvert00\rangle\lvert0\rangle+\tfrac1{\sqrt2}\lvert11\rangle\lvert1\rangle.

Result

S(ρ{0})=S(ρ{0,1})=S(ρ{2})=1 bit\boxed{S(\rho_{\{0\}})=S(\rho_{\{0,1\}})=S(\rho_{\{2\}})=1\ \text{bit}}
ρ{0,1}=Tr2∣GHZ⟩⟨GHZ∣=(120000000000000012)\rho_{\{0,1\}}=\mathrm{Tr}_2\lvert\mathrm{GHZ}\rangle\langle\mathrm{GHZ}\rvert=\begin{pmatrix}\frac12&0&0&0\\0&0&0&0\\0&0&0&0\\0&0&0&\frac12\end{pmatrix}
ρ_{01} = Tr_2 |GHZ⟩⟨GHZ|4×4

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 2−34log⁡232-\tfrac34\log_23, and prints the diagonal of ρ{0,1}\rho_{\{0,1\}} for the GHZ state.

TypeScriptrunnable
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.5000

What the entropy does and does not measure#

Derivation

Same marginal entropy, different global entropy

  1. Step 1:
    ∣Φ+⟩⟨Φ+∣:S(ρAB)=0,ρA=TrB∣Φ+⟩⟨Φ+∣=I2,S(ρA)=1\lvert\Phi^+\rangle\langle\Phi^+\rvert:\quad S(\rho_{AB})=0,\qquad \rho_A=\mathrm{Tr}_B\lvert\Phi^+\rangle\langle\Phi^+\rvert=\tfrac I2,\qquad S(\rho_A)=1
    The global state is pure; its marginal is maximally mixed (partial-trace lesson).
  2. Step 2:
    I4=I2⊗I2:S(ρAB)=2,ρA=TrBI4=I2 TrI2=I2,S(ρA)=1\tfrac I4=\tfrac I2\otimes\tfrac I2:\quad S(\rho_{AB})=2,\qquad \rho_A=\mathrm{Tr}_B\tfrac I4=\tfrac I2\,\mathrm{Tr}\tfrac I2=\tfrac I2,\qquad S(\rho_A)=1
    Additivity gives S(I4)=1+1S(\tfrac I4)=1+1; the partial trace of a product is the first factor times the trace of the second.
  3. Step 3:
    S(ρAB)−S(ρA)={−1∣Φ+⟩+1I/4S(\rho_{AB})-S(\rho_A)=\begin{cases}-1&\lvert\Phi^+\rangle\\+1&I/4\end{cases}
    For the Bell state the whole is less uncertain than the part, which is impossible for classical probability distributions (where H(X,Y)≥H(X)H(X,Y)\ge H(X)). A negative S(AB)−S(A)S(AB)-S(A) certifies entanglement; the maximally mixed state shows the classical ordering.

Quick check

A two-qubit state ρAB\rho_{AB} has S(ρA)=1S(\rho_A)=1 bit. What can you conclude?

Select one answer

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 S(ρA)S(\rho_A) close to the Page value near ∣A∣\lvert A\rvert bits, and this volume-law entanglement is one mechanism behind barren plateaus.

References

  1. 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).
  2. M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press (2017), Chapter 11 (quantum entropy and its properties).arxiv.org
  3. 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-graded

    Compute the entanglement entropy S(ρA)=−∑kλklog⁡2λkS(\rho_A)=-\sum_k\lambda_k\log_2\lambda_k of a Schmidt state from its Schmidt coefficients, then prepare a three-qubit state whose marginals ρ{0}\rho_{\{0\}}, ρ{0,1}\rho_{\{0,1\}} and ρ{2}\rho_{\{2\}} each carry exactly one bit of entropy. All entropies are in bits; qubit 0 is the leftmost bit.

    Open lab