Lean, informalized

Nielsen & Chuang · Chapter 11, Entropy and information · p. 523

Theorem 11.16 - Three inequalities between conditional entropies of three and four quantum systems

Conditional entropy is subadditive in both arguments.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

Three quantum systems AA, BB and CC, or four with a system DD, share a joint state ρ\rho. For a group XX of them, S(X)S(X) is the von Neumann entropy of the reduced state of XX, and the entropy of XX conditioned on a second group YY is S(X|Y)=S(X,Y)−S(Y),S(X|Y) = S(X,Y) - S(Y),(1) with S(X,Y)S(X,Y) the entropy of the two groups together.

Theorem 11.16 says that when one argument of a conditional entropy is a pair of systems, splitting the pair cannot lower it: the conditional entropy with the pair is at most the sum of the two in which one member of the pair takes its place. The pair may stand in either argument, as ABAB given CC or AA given BCBC. With four systems both arguments split at once, and ABAB given CDCD is compared with AA given CC and BB given DD.

Systems, States and Entropy

A quantum system XX is described by its state space, a finite dimensional complex Hilbert space.✦ The composite system X⊗YX \otimes Y of two quantum systems XX and YY is the quantum system whose state space is the tensor product of their state spaces.✦ A state ρ\rho of XX, pure or mixed, is a positive operator of unit trace on the state space of XX✦, and its von Neumann entropy, in nats, is S(ρ)=−tr⁡(ρlog⁡ρ).S(\rho) = -\operatorname{tr}(\rho \log \rho).(2)✦

For a state ρ\rho of X⊗YX \otimes Y, the reduced state ρX=tr⁡Yρ\rho^X = \operatorname{tr}_Y \rho of XX is the partial trace of ρ\rho over YY, taken in an orthonormal basis of the state space of YY.✦ The reduced state ρY=tr⁡Xρ\rho^Y = \operatorname{tr}_X \rho of YY is likewise the partial trace over XX, taken in an orthonormal basis of the state space of XX.✦

Regrouping the Systems

An identification ee of a quantum system XX with a quantum system YY is a linear isometric bijection from the state space of XX onto that of YY✦; along it, a state ρ\rho of XX is relabelled as the state eρe−1e \rho e^{-1} of YY.✦ The regrouping αX,Y,Z\alpha_{X,Y,Z} identifies X⊗(Y⊗Z)X \otimes (Y \otimes Z) with (X⊗Y)⊗Z(X \otimes Y) \otimes Z by |u⟩⊗(|v⟩⊗|w⟩)↦(|u⟩⊗|v⟩)⊗|w⟩|u\rangle \otimes (|v\rangle \otimes |w\rangle) \mapsto (|u\rangle \otimes |v\rangle) \otimes |w\rangle, and the swap swapX,Y\mathrm{swap}_{X,Y} identifies X⊗YX \otimes Y with Y⊗XY \otimes X by |u⟩⊗|v⟩↦|v⟩⊗|u⟩|u\rangle \otimes |v\rangle \mapsto |v\rangle \otimes |u\rangle.✦ The identity 1X1_X identifies XX with itself by the identity map of its state space.✦ Two identifications, ee of XX with X′X' and ff of YY with Y′Y', give their product e⊗fe \otimes f, the identification of X⊗YX \otimes Y with X′⊗Y′X' \otimes Y' by the tensor product of the two maps.✦

The reduced state of a group of systems is taken by relabelling along these identifications until the group is one factor of the composite, then tracing out the rest. For a state ρ\rho of A⊗(C⊗B)A \otimes (C \otimes B), the reduced states ρCB=tr⁡Aρ\rho^{CB} = \operatorname{tr}_A \rho and ρC=tr⁡BρCB\rho^{C} = \operatorname{tr}_B \rho^{CB} need no relabelling, while ρAC=tr⁡B(αA,C,BραA,C,B−1).\rho^{AC} = \operatorname{tr}_B\bigl(\alpha_{A,C,B}\,\rho\,\alpha_{A,C,B}^{-1}\bigr).(3) For a state of A⊗(B⊗C)A \otimes (B \otimes C), the pair ACAC is first brought together by 1A⊗swapB,C1_A \otimes \mathrm{swap}_{B,C} and then regrouped by αA,C,B\alpha_{A,C,B}.

The Claim

For a state ρ\rho of the composite system of all the systems, S(ρ)S(\rho) is its von Neumann entropy, and a difference S(ρXY)−S(ρY)S(\rho^{XY}) - S(\rho^{Y}) of reduced states is the conditional entropy S(X|Y)S(X|Y) (1).

Theorem 1. Let AA, BB, CC and DD be quantum systems. Every state ρ\rho of A⊗(C⊗B)A \otimes (C \otimes B) satisfies S(ρ)−S(ρC)≤[S(ρAC)−S(ρC)]+[S(ρCB)−S(ρC)],S(\rho) - S(\rho^{C}) \le \bigl[S(\rho^{AC}) - S(\rho^{C})\bigr] + \bigl[S(\rho^{CB}) - S(\rho^{C})\bigr],(4)✦ every state ρ\rho of A⊗(B⊗C)A \otimes (B \otimes C) satisfies S(ρ)−S(ρBC)≤[S(ρAB)−S(ρB)]+[S(ρAC)−S(ρC)],S(\rho) - S(\rho^{BC}) \le \bigl[S(\rho^{AB}) - S(\rho^{B})\bigr] + \bigl[S(\rho^{AC}) - S(\rho^{C})\bigr],(5)✦ and every state ρ\rho of A⊗(C⊗(D⊗B))A \otimes (C \otimes (D \otimes B)) satisfies S(ρ)−S(ρCD)≤[S(ρAC)−S(ρC)]+[S(ρDB)−S(ρD)].S(\rho) - S(\rho^{CD}) \le \bigl[S(\rho^{AC}) - S(\rho^{C})\bigr] + \bigl[S(\rho^{DB}) - S(\rho^{D})\bigr].(6)✦

What Is Checked

The three inequalities are stated over states of composite quantum systems, their reduced states and von Neumann entropies, and states relabelled along identifications of systems. The library proves of these constructions that the partial trace of a density operator is a density operator, and that a state relabelled along an identification is again a state, since conjugation by an isometry preserves positivity and trace.