Lean, informalized

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

Exercise 11.26 - The correlations of one system with two others are at most twice its entropy, though with one alone they can exceed it

Two mutual informations bounded by twice one entropy.

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 share a joint state. How strongly AA is correlated with BB is measured by the quantum mutual information S(A:B)S(A:B) of the reduced state of the pair ABAB, and its correlation with CC by S(A:C)S(A:C). The exercise bounds the two together by the entropy of AA alone: their sum never exceeds 2S(A)2S(A).✦ It then asks for a state of two systems in which a single mutual information is larger than the entropy, S(A:B)>S(A)S(A:B) > S(A), something classical correlations cannot do, since the mutual information of two random variables is at most the entropy of either.

Systems, States and Entropy

A quantum system AA is a physical system whose state space is a finite dimensional complex Hilbert space.✦ The composite system A⊗BA \otimes B of quantum systems AA and BB is the quantum system whose state space is the tensor product of their state spaces.✦ A state ρ\rho of a quantum system AA is a positive operator of unit trace on the state space of AA.✦

A state ρ\rho of a composite system A⊗BA \otimes B has two reduced states: the state ρA=Tr⁡Bρ\rho_A = \operatorname{Tr}_B \rho of AA, its partial trace over BB✦, and the state ρB=Tr⁡Aρ\rho_B = \operatorname{Tr}_A \rho of BB, its partial trace over AA.✦

The von Neumann entropy of a state ρ\rho is the Shannon entropy of the eigenvalues of ρ\rho, measured in nats: S(ρ)=−tr⁡(ρlog⁡ρ).S(\rho) = -\operatorname{tr}(\rho \log \rho).(1)✦ The quantum mutual information of a state ρ\rho of a composite system A⊗BA \otimes B is S(A:B)=S(ρA)+S(ρB)−S(ρ).S(A:B) = S(\rho_A) + S(\rho_B) - S(\rho).(2)✦

Regrouping Three Systems

An identification ee of a quantum system AA with a quantum system A′A' is a linear isometry of the state space of AA onto that of A′A', under which the two count as the same system up to reorganisation.✦ The relabelling of a state ρ\rho of AA along ee is the state eρe−1e \rho e^{-1} of A′A'.✦

The regrouping αA,B,C\alpha_{A,B,C} of quantum systems AA, BB and CC is the identification of A⊗(B⊗C)A \otimes (B \otimes C) with (A⊗B)⊗C(A \otimes B) \otimes C✦, and the swap swapB,C\mathrm{swap}_{B,C} of BB and CC is the identification of B⊗CB \otimes C with C⊗BC \otimes B.✦ On product vectors they act as αA,B,C:u⊗(v⊗w)↦(u⊗v)⊗w,swapB,C:v⊗w↦w⊗v.\alpha_{A,B,C}\colon u \otimes (v \otimes w) \mapsto (u \otimes v) \otimes w, \qquad \mathrm{swap}_{B,C}\colon v \otimes w \mapsto w \otimes v.(3) The identity idA\mathrm{id}_A of AA is its identification with itself by the identity map of its state space.✦ For identifications ee of AA with A′A' and ff of BB with B′B', the product e⊗fe \otimes f is the identification of A⊗BA \otimes B with A′⊗B′A' \otimes B' by the tensor product of the two isometries.✦

For a state ρ\rho of A⊗(B⊗C)A \otimes (B \otimes C), the reduced states of the pairs ABAB and ACAC are taken after the factors are regrouped, ρAB=Tr⁡C(αA,B,CραA,B,C−1),ρAC=Tr⁡B(βρβ−1),β=αA,C,B(idA⊗swapB,C),\rho_{AB} = \operatorname{Tr}_C\bigl(\alpha_{A,B,C}\,\rho\,\alpha_{A,B,C}^{-1}\bigr), \qquad \rho_{AC} = \operatorname{Tr}_B\bigl(\beta\,\rho\,\beta^{-1}\bigr), \quad \beta = \alpha_{A,C,B}\,(\mathrm{id}_A \otimes \mathrm{swap}_{B,C}),(4) and ρA=Tr⁡BCρ\rho_A = \operatorname{Tr}_{BC}\,\rho is the reduced state of ρ\rho on AA.

The Claim

Theorem 1. Let AA, BB and CC be quantum systems and ρ\rho a state of A⊗(B⊗C)A \otimes (B \otimes C). Write S(A:B)S(A:B) and S(A:C)S(A:C) for the mutual informations (2) of the reduced states ρAB\rho_{AB} and ρAC\rho_{AC} of (4), and S(A)S(A) for the entropy of ρA\rho_A. Then S(A:B)+S(A:C)≤2S(A).S(A:B) + S(A:C) \le 2\,S(A).(5)✦

Theorem 2. There are quantum systems AA and BB and a state ρ\rho of A⊗BA \otimes B with S(ρA)<S(A:B).S(\rho_A) < S(A:B).(6)✦

What Is Checked

Both claims are stated over states of composite quantum systems, their reduced states, and the entropy (1) and mutual information (2) built from them; the bound is stated in addition over the regrouping, the swap, the identity and their product in (4), with the relabelling of a state along each.

The library proves that the partial trace of a state over either factor is again a state, and that a state relabelled along an identification is a state, since conjugation by an isometry preserves positivity and trace.