L3-08 · Entropy and uncertainty
Calculate binary entropy and distinguish it from the value of one outcome.
Learn¶
Entropy measures uncertainty in a probability distribution. It does not measure the size or importance of an outcome. A fair coin has more entropy than a coin that always gives heads. The logarithm base determines the information unit. Base two gives bits.
For a discrete distribution, multiply each probability by the negative logarithm of that probability, then add. A zero-probability term contributes zero by continuity. For two possible outcomes, entropy is largest when their probabilities are equal. It becomes zero when either outcome is certain.
Classical entropy applies to recorded outcomes. Quantum states use a related quantity called von Neumann entropy, which depends on the density matrix eigenvalues. A pure quantum state can have zero von Neumann entropy while a chosen measurement on that state still has uncertain outcomes.
Practice¶
Solution
Each symbol has probability 1/4 and logarithm -2. Four equal contributions of -(1/4)(-2) give an entropy of 2 bits per symbol.
Check your understanding¶
Which binary distribution has the largest entropy?
A. Probabilities 0.5 and 0.5
B. Probabilities 0.9 and 0.1
C. Probabilities 1 and 0
Show the answer
A. Probabilities 0.5 and 0.5
Equal binary probabilities give maximum uncertainty over two outcomes. Increasing certainty about either outcome reduces the binary entropy.
Sources¶
This lesson draws on Watrous, 2018Preskill, n.d..
Next: L3-09 · Optimization and learning
- Watrous, J. (2018). The Theory of Quantum Information. https://cs.uwaterloo.ca/~watrous/TQI/
- Preskill, J. (n.d.). Course Information for Physics 219/Computer Science 219 Quantum Computation (Formerly Physics 229). California Institute of Technology course page with lecture notes. https://www.preskill.caltech.edu/ph219/