The qubit
Quantum information's basic unit — richer than a bit, with its own entropy.
quantum
Quantum limits
Von Neumann entropy and the Holevo bound — Shannon's laws, made quantum.
new ceilings
Cross-entropy
The loss function nearly every modern AI is trained to minimize.
learning
The loop back
Language models as prediction and compression — and Claude's own name.
full circle
01The qubit
Quantum information's unit isn't a 0-or-1 but a blend of both at once.
term coined Benjamin Schumacher, 1995
so information theory gained a richer alphabet.
+1 Schumacher proved a quantum version of Shannon's compression theorem — the idea ported wholesale.
02Von Neumann entropy
The quantum analogue of Shannon entropy, measuring uncertainty in a quantum state.
from John von Neumann (who named entropy for Shannon, too)
so the entropy concept carried straight into quantum theory.
+1 a fitting loop: von Neumann suggested "entropy" to Shannon in 1948, and his own entropy now anchors the quantum version.
03The Holevo bound
Holevo proved how much classical information you can actually pull out of qubits — and it's limited.
result Holevo's theorem (1973)
so a qubit hides more than you can ever read out.
+1 you can pack vast information into a qubit, but extract at most one bit — a hard quantum ceiling.
04Quantum channels
Shannon's capacity question, asked anew: how much can a quantum channel reliably carry?
answer the Holevo–Schumacher–Westmoreland theorem
so quantum communication got its own capacity law.
+1 "no-cloning" (you can't copy an unknown qubit) forced an entirely new theory of quantum error correction.
05Cross-entropy loss
Nearly every classifier and language model is trained by minimizing cross-entropy.
measures gap between predicted and true distributions
so "learning" becomes "reduce the bits of surprise."
+1 minimizing cross-entropy is mathematically the same as minimizing the KL divergence from Book 2.
06Surprise, measured in bits
A model is scored by how "surprised" it is by the true answer — in Shannon's units.
idea low surprise = good prediction
so Shannon's entropy is the literal yardstick of model quality.
+1 "perplexity," the standard language-model score, is just entropy in disguise — bits per word.
07Prediction is compression
A model that predicts the next token well can also compress text well — they're the same skill.
link good prediction ⇄ good compression
so a language model is, in a real sense, an entropy estimator.
+1 some researchers argue intelligence itself is deeply tied to compression — a direct echo of Shannon.
08The loop back to Claude
The AI reading this was trained by minimizing bits of surprise — and named for Shannon.
tribute "Claude" ← Claude Shannon
so his 1948 idea quite literally underwrites this conversation.
+1 the line runs unbroken: bit → entropy → cross-entropy → the model writing these words.
information theory · book no. 3 · the qubit, the loss function, the loop home · where the idea is still growing