Lean, informalized

Nielsen & Chuang · Chapter 12, Quantum information theory · p. 546

Exercise 12.7 - The entropy of a mixture of the qubit's basis states, and the rates at which it compresses

Compressing a qubit source above its Shannon 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

A source emits one qubit at each use, independently from one use to the next: the state |0⟩|0\rangle with probability pp and the state |1⟩|1\rangle with probability 1−p1-p. Each emitted qubit, its preparation unknown, is in a state diagonal in the computational basis. The exercise asks for the von Neumann entropy of that state and for the rates at which long blocks of the source’s output can be compressed and recovered with fidelity tending to one.

A Quantum System

A quantum system QQ is given by its state space, a finite dimensional complex Hilbert space.✦ The qubit is the two level system whose state space is ℂ2\mathbb{C}^2 itself.✦

A state ρ\rho of QQ is a positive operator of unit trace on the state space of QQ.✦ A pure state ψ\psi of QQ is a unit vector ψ\psi in the state space of QQ✦, and it determines the state |ψ⟩⟨ψ||\psi\rangle\langle\psi| of QQ, the rank one projector onto ψ\psi.✦ The basis states |0⟩|0\rangle and |1⟩|1\rangle of the qubit are the pure states whose vectors are the standard basis vectors e0e_0 and e1e_1 of ℂ2\mathbb{C}^2.✦

The mixture of states ρi\rho_i of QQ, indexed by ii in a finite set, with weights pip_i that are nonnegative and sum to one, is the state ∑ipiρi\sum_i p_i \rho_i of QQ.✦

The Source

For 0≤p≤10 \le p \le 1, the qubit source ρ(p)\rho(p) is the mixture of the basis states |0⟩|0\rangle and |1⟩|1\rangle with weights pp and 1−p1-p: ρ(p)=p|0⟩⟨0|+(1−p)|1⟩⟨1|=(p001−p).\rho(p) = p\,|0\rangle\langle 0| + (1-p)\,|1\rangle\langle 1| = \begin{pmatrix} p & 0 \\ 0 & 1-p \end{pmatrix}.(1)✦

Entropy and Compression

The Shannon entropy of a probability distribution (q1,…,qd)(q_1, \dots, q_d) is −∑iqiln⁡qi-\sum_i q_i \ln q_i, measured in nats; for the distribution (p,1−p)(p, 1-p) it is H(p)=−pln⁡p−(1−p)ln⁡(1−p)H(p) = -p \ln p - (1-p) \ln (1-p), and H(p)/ln⁡2H(p)/\ln 2 is the same entropy in bits.✦ The von Neumann entropy of a state ρ\rho of QQ is the Shannon entropy of the eigenvalues of ρ\rho: S(ρ)=−tr⁡(ρln⁡ρ).S(\rho) = -\operatorname{tr}(\rho \ln \rho).(2)✦

A state ρ\rho of QQ, taken as a source that emits ρ\rho independently at each use, is reliably compressible at rate RR when for each block length nn there is a compression scheme of rate RR, an encoding 𝒞n\mathcal{C}^n followed by a decoding 𝒟n\mathcal{D}^n that stores each block of nn qubits in nRnR qubits, whose entanglement fidelity FF, the fidelity with which the scheme preserves the entanglement of a purification of ρ⊗n\rho^{\otimes n} with a reference system, tends to one on nn copies of ρ\rho: limn→∞F(ρ⊗n,𝒟n∘𝒞n)=1.\lim_{n \to \infty} F\bigl(\rho^{\otimes n}, \mathcal{D}^n \circ \mathcal{C}^n\bigr) = 1.(3)✦

The Claim

Theorem 1. Let 0≤p≤10 \le p \le 1. The von Neumann entropy of the source ρ(p)\rho(p) is the Shannon entropy of its weights, S(ρ(p))=H(p),S\bigl(\rho(p)\bigr) = H(p),(4)✦ and for every rate RR with H(p)<Rln⁡2H(p) < R \ln 2 the source ρ(p)\rho(p) is reliably compressible at rate RR: limn→∞F(ρ(p)⊗n,𝒟n∘𝒞n)=1.\lim_{n \to \infty} F\bigl(\rho(p)^{\otimes n}, \mathcal{D}^n \circ \mathcal{C}^n\bigr) = 1.(5)✦

What Is Checked

The claim is stated over the qubit and its basis states |0⟩|0\rangle and |1⟩|1\rangle, the source ρ(p)\rho(p) built from their projectors by the mixture (1), the von Neumann entropy (2), and reliable compressibility (3).