Chapter 16: Von Neumann Entropy

Part VI: Quantum Information

Definition

\( S(\rho) = -\text{Tr}(\rho \ln \rho) = -\sum_i \lambda_i \ln \lambda_i \)

where \(\lambda_i\) are the eigenvalues of the density matrix \(\rho\)

John von Neumann introduced this measure in 1927 as the quantum analog of the Boltzmann entropy. For a quantum system in state \(\rho\) (a positive semidefinite Hermitian operator with \(\text{Tr}(\rho) = 1\)):

  • For pure states \(\rho = |\psi\rangle\langle\psi|\): \(S(\rho) = 0\) (no uncertainty)
  • For the maximally mixed state \(\rho = I/d\): \(S(\rho) = \ln d\) (maximum entropy)
  • In bits: divide by \(\ln 2\)

Relation to Shannon Entropy

The Von Neumann entropy reduces to Shannon entropy when the density matrix is diagonal:

\( \rho = \sum_i p_i |i\rangle\langle i| \implies S(\rho) = -\sum_i p_i \ln p_i = H(\{p_i\}) \)

The key difference: quantum systems can be in coherent superpositions, and entropy depends on the basis. The Von Neumann entropy is basis-independent (it only depends on eigenvalues), measuring genuine quantum uncertainty.

Measuring a quantum system in a specific basis increases entropy (collapses superpositions), while coherent evolution (unitary operations) preserves it.

Key Properties

Subadditivity

\( S(AB) \leq S(A) + S(B) \)

Joint entropy never exceeds sum of individual entropies. Equality iff \(\rho_{AB} = \rho_A \otimes \rho_B\) (product state).

Strong Subadditivity (SSA)

\( S(ABC) + S(B) \leq S(AB) + S(BC) \)

Proven by Lieb and Ruskai (1973). One of the most important inequalities in quantum information theory.

Araki-Lieb Triangle Inequality

\( S(AB) \geq |S(A) - S(B)| \)

Unlike classical entropy, a quantum subsystem can have more entropy than the whole system (when entangled).

Unitary Invariance

\( S(U\rho U^\dagger) = S(\rho) \) for any unitary \(U\)

Reversible quantum operations preserve entropy; only irreversible operations (measurements, decoherence) change it.

Entanglement Entropy & Purification

For a bipartite system \(AB\) in a pure state, the entanglement entropy is the Von Neumann entropy of either reduced density matrix:

\( E(|\psi\rangle_{AB}) = S(\rho_A) = S(\rho_B) \quad \text{where } \rho_A = \text{Tr}_B(|\psi\rangle\langle\psi|) \)

Purification: Any mixed state \(\rho_A\)can be "purified" — embedded as a pure state in a larger system \(AB\)such that \(\text{Tr}_B(|\psi\rangle\langle\psi|) = \rho_A\). This is central to the Church of the Larger Hilbert Space (Stinespring dilation theorem).

Entanglement entropy quantifies quantum correlations between \(A\) and \(B\). For a Bell state \(|\Phi^+\rangle = (|00\rangle + |11\rangle)/\sqrt{2}\),\(S(\rho_A) = 1\) bit — maximal entanglement.

Python: Von Neumann Entropy Computations

Compute entropies for pure states, maximally mixed states, Werner states, and bipartite systems. Plot entanglement entropy vs mixing parameter.

Python
script.py142 lines

Click Run to execute the Python code

Code will be executed with Python 3 on the server