Quantum Entropy
Quantum entropy measures spectral uncertainty and information content of a density operator. Its central form is the von Neumann entropy
This is not merely the Shannon entropy of whichever measurement happens to be performed. It is basis independent and depends only on the eigenvalues of . Different entropy expressions answer different operational questions, so the state, subsystems, logarithm base, and asymptotic setting must be stated.
Conventions and Spectral Form
Section titled “Conventions and Spectral Form”Let
Functional calculus gives
with by continuity. This page uses base- logarithms when entropy is reported in bits. Natural logarithms give nats and multiply every value by relative to bits:
For a -dimensional state,
The lower value occurs exactly for a pure state; the upper value occurs exactly for the maximally mixed state .
Why the Spectrum Is the Right Object
Section titled “Why the Spectrum Is the Right Object”If , then has the same eigenvalues as , so
Matrix off-diagonal entries are basis dependent, while entropy is not. A pure coherent superposition can have a broad probability distribution in a chosen measurement basis and still have zero von Neumann entropy.
For a qubit with eigenvalues and ,
Equivalently, if , then .
Products, Classical Flags, and Mixtures
Section titled “Products, Classical Flags, and Mixtures”Entropy is additive on tensor products:
For a state with an orthogonal classical flag,
one has the exact block-diagonal identity
For an unflagged mixture , concavity gives
The companion upper bound
shows how much uncertainty can be added by forgetting a classical label. Equality conditions depend on the supports of the component states.
Rényi Entropies
Section titled “Rényi Entropies”For , , the quantum Rényi entropy is
Important limits are
Rényi entropies emphasize different parts of the spectrum. Their data processing and operational properties depend on which quantum Rényi divergence is used; formulas from distinct conventions should not be mixed.
Bipartite Entropy and Conditional Entropy
Section titled “Bipartite Entropy and Conditional Entropy”For a state , define
The conditional entropy is
Unlike classical conditional entropy, it can be negative. Negative is a quantum correlation signature with operational roles in state merging; it is not a negative number of classical outcomes.
Subadditivity and the Araki–Lieb inequality state
Together they bound the possible entropy triples of a bipartite state.
Pure Bipartite States and Entanglement Entropy
Section titled “Pure Bipartite States and Entanglement Entropy”If is pure, its Schmidt decomposition implies that and have the same nonzero eigenvalues. Therefore
The shared value is the entropy of entanglement for a pure bipartite state. It vanishes exactly for a product state. In this case,
For mixed states, subsystem entropy alone is not an entanglement measure; classical mixing also contributes.
Mutual Information
Section titled “Mutual Information”Quantum mutual information is
It is nonnegative, vanishes exactly for a product state, and measures total correlation rather than entanglement alone. It also has the relative-entropy form
For a pure bipartite state,
For a perfectly correlated classical bit pair, bit, whereas a Bell pair has bits. The extra bit reflects quantum coherence and negative conditional entropy, not two independent classical shared bits.
Relative Entropy and Data Processing
Section titled “Relative Entropy and Data Processing”The quantum relative entropy is
provided ; otherwise it is . It is not symmetric and is not a metric.
Klein’s inequality gives
with equality exactly when . For a quantum channel , data processing gives
The same principle implies that a local channel cannot increase mutual information:
This is a statement about discarded distinguishability, not a claim that every entropy of every subsystem must increase under every channel.
Strong Subadditivity
Section titled “Strong Subadditivity”For every tripartite state,
Equivalently, the conditional mutual information
is nonnegative. Strong subadditivity underlies monotonicity of mutual information, consistency of conditional entropy, and the structure of quantum Markov chains. It is a theorem, not an assumption about weak correlations.
Classical–Quantum States and the Holevo Quantity
Section titled “Classical–Quantum States and the Holevo Quantity”For the classical–quantum state
the mutual information is the Holevo quantity
The Holevo bound limits how much classical information about can be recovered from a measurement on . It does not say that every measurement achieves , nor does it convert nonorthogonal signal states into perfectly distinguishable classical symbols.
Continuity and Infinite-Dimensional Cautions
Section titled “Continuity and Infinite-Dimensional Cautions”Let
In dimension , for , the sharp continuity bound is
Outside that parameter range the trivial bound remains safe. The dimension dependence is essential: entropy is not uniformly continuous on the unrestricted infinite-dimensional state space.
In infinite dimensions, finite trace does not guarantee finite entropy. Thermal or energy-constrained continuity statements require explicit Hamiltonian and energy assumptions. Expressions such as have no meaning when unless a cutoff or effective support is part of the model.
Thermodynamic Cautions
Section titled “Thermodynamic Cautions”Information entropy is dimensionless once a logarithm base is fixed. Thermodynamic entropy often includes Boltzmann’s constant:
The equality between von Neumann entropy and a thermodynamic entropy is context dependent: the state, coarse graining, ensemble, conserved quantities, and equilibrium assumptions matter. A unitary evolution preserves the fine-grained entropy of a closed system even while a coarse-grained or subsystem entropy can increase.
Diagnostic Examples
Section titled “Diagnostic Examples”Product state
Section titled “Product state”For ,
Bell pair
Section titled “Bell pair”For
the joint state is pure while each marginal is maximally mixed:
so
Perfectly correlated classical bits
Section titled “Perfectly correlated classical bits”For
one has
and therefore and .
Common Mistakes
Section titled “Common Mistakes”- Omitting the logarithm base when reporting a numerical entropy.
- Treating von Neumann entropy as the entropy of one arbitrary measurement distribution.
- Assuming conditional entropy must be nonnegative.
- Calling mutual information an entanglement measure for mixed states.
- Using without checking the support condition.
- Assuming every channel increases entropy; reset and cooling channels give immediate counterexamples.
- Applying finite-dimensional continuity bounds with no dimension or energy constraint.
- Interpreting fine-grained unitary entropy conservation as a denial of thermodynamic entropy production.
Where to Go Next
Section titled “Where to Go Next”- Information-Theoretic Foundations routes entropy, correlation, distinguishability, and resource questions to their canonical owners; Mutual Information owns the structural bipartite examples, while Relative Entropy owns the classical KL support and statistical baseline.
- Classical Information Review owns classical source, coding, secrecy, and comparator baselines; this page owns von Neumann and Rényi entropies, quantum relative entropy, data processing, and Holevo quantities.
- Resource Theories uses contractive divergences as monotones only after the free set, free transformations, task, and regime are fixed; this page owns quantum relative entropy and data processing.
- Entanglement Entropy owns the bipartite entanglement treatment.
- Density Operators for Quantum Information supplies the state language.
- Entropy Identities is the compact convention-aware lookup card.
- Von Neumann Entropy is the single-formula reference.
- Trace Distance supplies the continuity parameter used above.
References
Section titled “References”- J. von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton University Press, 1955.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018.
- M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017.
- E. H. Lieb and M. B. Ruskai, ‘Proof of the Strong Subadditivity of Quantum-Mechanical Entropy,’ Journal of Mathematical Physics 14, 1938-1941 (1973).
- K. M. R. Audenaert, ‘A Sharp Continuity Estimate for the von Neumann Entropy,’ Journal of Physics A 40, 8127-8136 (2007).
- A. S. Holevo, Quantum Systems, Channels, Information, 2nd ed., De Gruyter, 2019.
Exercises
Section titled “Exercises”- Compute , , , , and for a product of two maximally mixed qubits.
Solution
Each marginal is , so bit. Their product is , so bits. Hence
- Let be pure. Prove the conditional-entropy duality .
Solution
Purity gives and . Therefore
- An ensemble contains mutually orthogonal pure states with probabilities . Compute its Holevo quantity.
Solution
Each signal state has zero entropy. The average state is diagonal with eigenvalues , so
An orthogonal measurement can attain this value.
- Let a local channel act on . Use data processing to show that cannot increase.
Solution
Write mutual information as relative entropy:
Apply to both arguments and use data processing. The first becomes the output joint state and the second becomes the product of its marginals, so the resulting relative entropy is the output mutual information and cannot exceed the input value.