Expectation Values and Variance

A single quantum measurement tells you almost nothing. Prepare an electron in a superposition of box states, measure its energy once, and you get one eigenvalue — a coin flip's worth of information about a state that took real work to prepare. The theory's actual predictions live one level up, in the statistics of many identically prepared systems: the mean of the outcomes, and the spread around that mean. This article builds both objects in the formalism's own language — the expectation value ⟨A^⟩=⟨ψ∣A^∣ψ⟩\langle\hat A\rangle = \langle\psi|\hat A|\psi\rangle and the variance σA2=⟨A^2⟩−⟨A^⟩2\sigma_A^2 = \langle\hat A^2\rangle - \langle\hat A\rangle^2 — and proves the identities that make them computable and trustworthy. Two derivations carry the page. The first unpacks the sandwich: inserting the eigenbasis turns ⟨ψ∣A^∣ψ⟩\langle\psi|\hat A|\psi\rangle into ∑nan∣cn∣2\sum_n a_n|c_n|^2 — a Born-probability-weighted average, which is why the abstract sandwich deserves the name "expectation value" — and the same move handles every moment ⟨A^k⟩\langle\hat A^k\rangle at once. The second rewrites the variance as a squared length, σA2=∥(A^−⟨A^⟩)ψ∥2\sigma_A^2 = \|(\hat A - \langle\hat A\rangle)\psi\|^2: variance is geometry, manifestly non-negative, zero exactly on eigenstates, and — three articles from now — the object the generalized uncertainty principle is built from. Then the payoff modern textbooks skip: what do these numbers do? Chebyshev's inequality turns σ into a guarantee — no more than 1/k21/k^2 of your measurement records can land more than kσk\sigma from the mean, whatever the spectrum looks like. And the shot-budget rule SE=σ/N\mathrm{SE} = \sigma/\sqrt N tells you how many runs buy how many digits of ⟨A^⟩\langle\hat A\rangle — the arithmetic that governs every expectation-value estimate on today's quantum processors, where "measure the energy" literally means thousands of prepared-and-collapsed circuits, averaged.

Key takeaways
  • ⟨A^⟩=⟨ψ∣A^∣ψ⟩\langle\hat A\rangle = \langle\psi|\hat A|\psi\rangle is the ensemble mean: many copies, one measurement each — not repeated measurement of one copy (collapse forbids that reading).
  • Insert the eigenbasis: ⟨A^⟩=∑nan∣cn∣2\langle\hat A\rangle = \sum_n a_n|c_n|^2 and, in one stroke, ⟨A^k⟩=∑nank∣cn∣2\langle\hat A^k\rangle = \sum_n a_n^k|c_n|^2 — spectral weights do all statistics.
  • ⟨A^⟩\langle\hat A\rangle is real for Hermitian A^\hat A (recalled from the Hermiticity theorems) and need not be an eigenvalue: 2.92 E12.92\,E_1 is a legal mean over the menu {E1,4E1}\{E_1, 4E_1\}.
  • Norm form: σA2=∥(A^−⟨A^⟩)ψ∥2≥0\sigma_A^2 = \|(\hat A - \langle\hat A\rangle)\psi\|^2 \ge 0, with σ=0\sigma = 0 exactly on eigenstates — variance is a squared length.
  • Chebyshev: P(∣a−⟨A^⟩∣≥kσ)≤1/k2P(|a - \langle\hat A\rangle| \ge k\sigma) \le 1/k^2 — the model-free tail guarantee σ buys you.
  • Shots: the standard error of an NN-run estimate is σ/N\sigma/\sqrt N; pinning a mean to ±σ/100\pm\sigma/100 costs 10410^4 runs.
  • Key idea: the expectation value is the Born-weighted mean ∑nan∣cn∣2\sum_n a_n |c_n|^2, computed without diagonalizing anything as ⟨ψ∣A^∣ψ⟩\langle\psi|\hat A|\psi\rangle; the variance is its spread, and both are statements about ensembles, not single shots.
The core insight

The expectation value ⟨A^⟩=⟨ψ∣A^∣ψ⟩\langle\hat A\rangle = \langle\psi|\hat A|\psi\rangle is the ensemble mean of measurement outcomes — equal to ∑nan∣⟨an∣ψ⟩∣2\sum_n a_n|\langle a_n|\psi\rangle|^2 — and the variance σA2=⟨A^2⟩−⟨A^⟩2\sigma_A^2 = \langle\hat A^2\rangle - \langle\hat A\rangle^2 measures the intrinsic spread of those outcomes around it.

Where this lives today

"Estimate an expectation value" is arguably the most-executed quantum computation on Earth. Variational algorithms (VQE and descendants) approximate molecular energies as sums ⟨H^⟩=∑jwj⟨P^j⟩\langle\hat H\rangle = \sum_j w_j\langle\hat P_j\rangle of Pauli-string expectations, each estimated from thousands of prepared-and-collapsed circuits; the σ/N\sigma/\sqrt N shot budget — with σ computed exactly as in this article — dictates runtime, and entire research programs (operator grouping, classical shadows) exist to shave it. Precision metrology lives on the same ledger: atomic clocks report ⟨transition frequency⟩\langle\text{transition frequency}\rangle with standard errors ground down by NN and by squeezing tricks that redistribute variance between conjugate observables. Even quantum-hardware benchmarking is variance bookkeeping — readout fidelity is inferred from the spread of repeated stabilizer expectations. The sandwich you learned to unpack is a production workload.

The physical picture

Run the movie honestly. A source prepares the same state ∣ψ⟩|\psi\rangle, over and over. Each copy meets a measuring device once; each measurement returns one eigenvalue and collapses that copy (last article's rule — which is why one copy cannot be polled twice). After ten thousand runs you hold a histogram: eigenvalues on the horizontal axis, relative frequencies converging to the Born weights ∣cn∣2|c_n|^2. The expectation value is that histogram's center of mass. The standard deviation is its width. Everything this article proves is a statement about that histogram, computed without building it — straight from the state vector.

Figure
One state, many shots — the histogram behind ⟨Â⟩ and σ
Expectation value = center of mass of the outcome histogram identical preparations |ψ⟩ → one measurement each → eigenvalue menu with Born weights E₁ |c₁|² = 9/25 E₂ = 4E₁ |c₂|² = 16/25 ⟨H⟩ = 2.92 E₁ never an outcome — the mean of the menu ± σ = 1.44 E₁ around the mean state: (3ψ₁+4ψ₂)/5 two bars, exact weights from |cₙ|²

Notice what the picture rules out. The mean 2.92 E12.92\,E_1 is not a possible reading — no single measurement ever returns it, any more than a family has 2.4 children. The spread σ is not measurement error — the apparatus is perfect in this story; the width is the state's own indeterminacy, present before any detector misbehaves. And the whole construction presumes fresh copies: measure one copy twice and the second result is rigged by collapse (probability 1 of repeating the first — the repeatability theorem), telling you about the update rule, not about ∣ψ⟩|\psi\rangle. The wave-mechanics chapter met these ideas in integral clothing — ⟨x⟩=∫ψ∗x ψ dx\langle x\rangle = \int\psi^* x\,\psi\,dx and the swinging-centroid examples of its Expectation Values article. What is new at the formalism register is leverage: one abstract identity per concept, valid for any observable with any spectrum, plus the statistical guarantees that make σ operationally meaningful. The wave-register article remains the place for the correspondence story; this one owns the machinery.

The sandwich, unpacked

Why should the abstract sandwich ⟨ψ∣A^∣ψ⟩\langle\psi|\hat A|\psi\rangle — computable in any basis, no diagonalization required — equal the experimental mean? Because the eigenbasis unpacks it into exactly the Born-weighted average, and the Born rule article (five serials back) certified those weights as outcome probabilities.

Derivation AFrom the sandwich to the spectral average — all moments at once

We prove ⟨ψ∣A^∣ψ⟩=∑nan∣cn∣2\langle\psi|\hat A|\psi\rangle = \sum_n a_n|c_n|^2 and, with no extra work, ⟨ψ∣A^k∣ψ⟩=∑nank∣cn∣2\langle\psi|\hat A^k|\psi\rangle = \sum_n a_n^k|c_n|^2 for every power kk. The strategy is the chapter's signature move: expand the state in the eigenbasis of A^\hat A (existence certified by the Hermiticity theorems plus the basis articles), let A^\hat A act where it is diagonal, and collect. Degenerate spectra ride along free of charge if nn labels basis vectors rather than distinct eigenvalues.

Step 1. Expand ∣ψ⟩=∑ncn∣an⟩|\psi\rangle = \sum_n c_n|a_n\rangle with cn=⟨an∣ψ⟩c_n = \langle a_n|\psi\rangle (the expansion theorem of Complete Orthonormal Bases — cited, not re-proved). Apply the operator where it is trivial: A^∣ψ⟩=∑ncnan∣an⟩\hat A|\psi\rangle = \sum_n c_n a_n|a_n\rangle.

Step 2. Close the sandwich with the bra ⟨ψ∣=∑mcm∗⟨am∣\langle\psi| = \sum_m c_m^*\langle a_m| and use orthonormality ⟨am∣an⟩=δmn\langle a_m|a_n\rangle = \delta_{mn}:

⟨ψ∣A^∣ψ⟩=∑m,ncm∗cn an δmn=∑nan ∣cn∣2(1)\langle\psi|\hat A|\psi\rangle = \sum_{m,n} c_m^* c_n\, a_n\,\delta_{mn} = \sum_n a_n\,|c_n|^2 \qquad (1)

Why this is the experimental mean: ∣cn∣2=P(an)|c_n|^2 = P(a_n) by the Born rule, and a probability-weighted sum of outcomes is the definition of an ensemble average. The two faces — basis-free sandwich, spectral average — are the same number; use whichever the problem hands you cheaply.

Step 3. Iterate for moments. Since A^k∣an⟩=ank∣an⟩\hat A^k|a_n\rangle = a_n^k|a_n\rangle (powers of an operator act as powers of the eigenvalue on its eigenvectors), the identical computation gives ⟨A^k⟩=∑nank∣cn∣2\langle\hat A^k\rangle = \sum_n a_n^k|c_n|^2. Every statistical question about the outcome distribution — mean, variance, skew, full histogram — is encoded in the spectral weights, extracted by sandwiches.

Step 4. Bank the reality check: for Hermitian A^\hat A, ⟨A^⟩\langle\hat A\rangle is real — that is Theorem 3 of Hermitian Operators and Observables, recalled here rather than re-proved; equation (1) makes it visible a second way (real eigenvalues, non-negative weights). Verified: numerically on random 6×66\times6 Hermitian matrices and random states — sandwich equals spectral sum for A^\hat A and A^2\hat A^2 to machine precision; imaginary part of the sandwich <10−12< 10^{-12}.

The mean deserves one honest disclaimer before the spread: it can be a value the system never takes. For the two-level box state of the hero figure, every measurement returns E1E_1 or 4E14E_1; the mean 2.92 E12.92\,E_1 sits in the forbidden gap. "Expectation" is a probabilist's word, not a prophecy — what you expect is the average of many shots, never necessarily any one of them.

Variance is a length

The spread around the mean is captured by the variance, defined as the mean squared deviation. Its two standard faces are one subtraction apart, but its third face is the one the rest of this chapter runs on. Center the operator — define ΔA^≡A^−⟨A^⟩\Delta\hat A \equiv \hat A - \langle\hat A\rangle (a legal Hermitian operator: observable minus number) — and compute:

σA2  =  ⟨(A^−⟨A^⟩)2⟩  =  ⟨A^2⟩−⟨A^⟩2  =  ∥ ΔA^ ∣ψ⟩ ∥2(2)\sigma_A^2 \;=\; \langle(\hat A - \langle\hat A\rangle)^2\rangle \;=\; \langle\hat A^2\rangle - \langle\hat A\rangle^2 \;=\; \bigl\|\,\Delta\hat A\,|\psi\rangle\,\bigr\|^2 \qquad (2)

where: the middle equality is two lines of algebra (expand the square, use linearity of ⟨⋅⟩\langle\cdot\rangle); the right one uses Hermiticity of ΔA^\Delta\hat A to fold both copies into a norm: ⟨ψ∣ΔA^ ΔA^∣ψ⟩=⟨ΔA^ ψ∣ΔA^ ψ⟩\langle\psi|\Delta\hat A\,\Delta\hat A|\psi\rangle = \langle\Delta\hat A\,\psi|\Delta\hat A\,\psi\rangle. Read it geometrically: variance is the squared length of the vector ΔA^∣ψ⟩\Delta\hat A|\psi\rangle — how far the operator pushes the state when the mean is subtracted off.

Go deeper · Derivation B · 1 minThe norm form and what it settles for free
Derivation BThe norm form and what it settles for free

We derive equation (2)'s norm form and harvest its three immediate consequences: non-negativity, the eigenstate criterion, and the launchpad for the uncertainty principle. The strategy is pure inner-product algebra — the payoff of doing statistics inside a Hilbert space is that "spread" becomes "length", and lengths obey geometry.

Step 1. Expand the defining mean squared deviation using linearity and ⟨A^⟩∈R\langle\hat A\rangle \in \mathbb R:

⟨(A^−⟨A^⟩)2⟩=⟨A^2⟩−2⟨A^⟩⟨A^⟩+⟨A^⟩2=⟨A^2⟩−⟨A^⟩2\langle(\hat A - \langle\hat A\rangle)^2\rangle = \langle\hat A^2\rangle - 2\langle\hat A\rangle\langle\hat A\rangle + \langle\hat A\rangle^2 = \langle\hat A^2\rangle - \langle\hat A\rangle^2

Why the cross term collapsed: ⟨A^⋅c⟩=c⟨A^⟩\langle\hat A\cdot c\rangle = c\langle\hat A\rangle for the number c=⟨A^⟩c = \langle\hat A\rangle — expectation is linear and the mean is a scalar, not an operator.

Step 2. Fold into a norm. ΔA^\Delta\hat A is Hermitian (difference of Hermitian and real multiple of identity), so one copy hops across the inner product: σA2=⟨ψ∣ΔA^2∣ψ⟩=⟨ΔA^ψ∣ΔA^ψ⟩=∥ΔA^ψ∥2\sigma_A^2 = \langle\psi|\Delta\hat A^2|\psi\rangle = \langle\Delta\hat A\psi|\Delta\hat A\psi\rangle = \|\Delta\hat A\psi\|^2.

Step 3. Harvest. (i) σA2≥0\sigma_A^2 \ge 0 always — a squared length, no case analysis. (ii) σA=0  ⟺  ΔA^∣ψ⟩=0  ⟺  A^∣ψ⟩=⟨A^⟩∣ψ⟩\sigma_A = 0 \iff \Delta\hat A|\psi\rangle = 0 \iff \hat A|\psi\rangle = \langle\hat A\rangle|\psi\rangle: zero spread exactly when ∣ψ⟩|\psi\rangle is an eigenstate, the mean then being the eigenvalue. This is the determinate-state loop the wave chapter closed — Standard Deviation and Quantum Uncertainty owns the theorem at the wave register; the norm form makes it one line here, and we recall rather than re-annex it. (iii) The vector ΔA^∣ψ⟩\Delta\hat A|\psi\rangle is the input to Cauchy–Schwarz when two observables compete — precisely how the Generalized Uncertainty Principle, three serials on, will manufacture σAσB≥12∣⟨[A^,B^]⟩∣\sigma_A\sigma_B \ge \tfrac12|\langle[\hat A,\hat B]\rangle|. Variance was built for that argument.

Step 4. Two-outcome closed form, for the pocket. If only two eigenvalues a1,a2a_1, a_2 carry weight (pp and 1−p1-p), the variance collapses to σ2=p(1−p)(a2−a1)2\sigma^2 = p(1-p)(a_2 - a_1)^2 — maximal at the fifty-fifty split, vanishing as either weight dies. Worth memorizing: half of exam statistics is this formula. Verified: symbolically (sympy) — the two-point identity σ2=p(1−p)ΔE2\sigma^2 = p(1-p)\Delta E^2 exact; numerically — norm form equals ⟨A^2⟩−⟨A^⟩2\langle\hat A^2\rangle - \langle\hat A\rangle^2 on random Hermitian/state pairs to 10−1310^{-13}; eigenstate variance <10−10< 10^{-10}.

Figure
Variance as geometry — the centered operator stretches the state, σ is the stretch
σ² = ‖(Â − ⟨Â⟩)|ψ⟩‖² — spread is a squared length |ψ⟩ (unit length) (Â−⟨Â⟩)|ψ⟩ length = σ_A read the length: σ = 0 ⇔ centered operator kills |ψ⟩ ⇔ eigenstate: value certain σ positive ⇔ genuine spread — many outcomes live inside the state two such vectors + Cauchy–Schwarz = the uncertainty principle (GUP, ahead) a squared length is never negative — non-negativity of variance with zero case analysis

What σ guarantees: Chebyshev and the shot budget

A width is only useful if it bounds something. Chebyshev's inequality — classical probability, applied here to the spectral weights — is the guarantee: for any state, any Hermitian observable, and any k>1k > 1,

P(∣a−⟨A^⟩∣≥k σA)  ≤  1k2(3)P\bigl(|a - \langle\hat A\rangle| \ge k\,\sigma_A\bigr) \;\le\; \frac{1}{k^2} \qquad (3)

where: the left side sums the Born weights of all eigenvalues at least kσk\sigma from the mean. The proof is two honest lines with the machinery already on the table: every term in σ2=∑npn(an−⟨A^⟩)2\sigma^2 = \sum_n p_n(a_n - \langle\hat A\rangle)^2 is non-negative, so keeping only far-out terms and replacing each (an−⟨A^⟩)2(a_n - \langle\hat A\rangle)^2 by its floor k2σ2k^2\sigma^2 gives σ2≥k2σ2P(far)\sigma^2 \ge k^2\sigma^2 P(\text{far}) — divide. No Gaussian assumption, no continuum limit; the bound is model-free (and correspondingly generous — real distributions usually beat it by a lot, as the worked example checks). The second guarantee prices estimation. Measuring ⟨A^⟩\langle\hat A\rangle in the laboratory means averaging NN collapsed outcomes; the sample mean is itself a random variable, centered on ⟨A^⟩\langle\hat A\rangle with standard error σA/N\sigma_A/\sqrt N (independent identical shots — classical statistics on quantum weights). Inverting: one more decimal digit of an expectation value costs a hundredfold more measurements. That 1/N1/\sqrt N wall is the daily economics of every variational quantum algorithm and every precision spectroscopy run — and the reason squeezed and entangled probes (which beat it) are worth billions of research euros, a story flagged for later chapters.

Limiting cases

caseresultmeaning
∣ψ⟩|\psi\rangle an eigenstate of A^\hat A⟨A^⟩=a\langle\hat A\rangle = a, σA=0\sigma_A = 0determinate value; the only case where one shot suffices
two outcomes, weights p,1−pp, 1-pσ2=p(1−p)(a2−a1)2\sigma^2 = p(1-p)(a_2-a_1)^2maximal spread at 50/50; vanishes at the edges
A^=1\hat A = \mathbb 1⟨A^⟩=1\langle\hat A\rangle = 1, σ=0\sigma = 0 in every statenormalization restated as statistics
compatible refinement measured first⟨A^⟩\langle\hat A\rangle unchangedcommuting projectors don't shift means — commutator article's doctrine
k=1k = 1 in Chebyshevbound ≤1\le 1: vacuousσ constrains tails, not the bulk
N→∞N \to \infty shotssample mean →⟨A^⟩\to \langle\hat A\rangle at rate σ/N\sigma/\sqrt Nthe ensemble reading made quantitative
mixed preparation⟨A^⟩=Tr(ρA^)\langle\hat A\rangle = \mathrm{Tr}(\rho\hat A)the density-operator article's generalization, four serials on

Worked examples

Example 1 — energy statistics in a box (confidence builder). An electron in a L=1 nmL = 1\,\mathrm{nm} infinite square well (E1=0.376 eVE_1 = 0.376\,\mathrm{eV}) is prepared in ∣ψ⟩=15(3∣1⟩+4∣2⟩)|\psi\rangle = \tfrac{1}{5}(3|1\rangle + 4|2\rangle). Find ⟨H^⟩\langle\hat H\rangle, σH\sigma_H, and check Chebyshev.

Step 1. Weights: P(E1)=9/25P(E_1) = 9/25, P(E2)=16/25P(E_2) = 16/25 (sum 1 ✓). Menu: E1E_1 and E2=4E1E_2 = 4E_1.

Step 2. Mean by equation (1): ⟨H^⟩=9+16⋅425E1=7325E1=2.92 E1=1.10 eV\langle\hat H\rangle = \tfrac{9 + 16\cdot4}{25}E_1 = \tfrac{73}{25}E_1 = 2.92\,E_1 = \boxed{1.10\ \mathrm{eV}} — in the gap, not on the menu.

Step 3. Spread by the two-point formula: σH2=925⋅1625 (3E1)2\sigma_H^2 = \tfrac{9}{25}\cdot\tfrac{16}{25}\,(3E_1)^2, so σH=3⋅1225E1=1.44 E1=0.54 eV\sigma_H = \tfrac{3\cdot12}{25}E_1 = 1.44\,E_1 = \boxed{0.54\ \mathrm{eV}}. (Cross-check via ⟨H^2⟩−⟨H^⟩2\langle\hat H^2\rangle - \langle\hat H\rangle^2: identical, machine-verified.)

Step 4. Chebyshev audit: the deviations are ∣E1−⟨H^⟩∣=43σ|E_1 - \langle\hat H\rangle| = \tfrac43\sigma and ∣E2−⟨H^⟩∣=34σ|E_2 - \langle\hat H\rangle| = \tfrac34\sigma. At k=43k = \tfrac43 the exact tail is P(E1)=0.36P(E_1) = 0.36, safely under the bound 9/16=0.56259/16 = 0.5625; at k=2k = 2 the exact tail is 00 against a bound of 0.250.25 — the inequality is honest and generous. Bonus: pinning ⟨H^⟩\langle\hat H\rangle to ±0.01E1\pm 0.01 E_1 needs N=(1.44/0.01)2≈2.1×104N = (1.44/0.01)^2 \approx 2.1\times10^4 shots.

Example 2 — spin statistics on a tilted state (exam level). A spin-12\tfrac12 is prepared along an axis tilted θ=60°\theta = 60° from zz: ∣ψ⟩=cos⁡θ2∣+z⟩+sin⁡θ2∣−z⟩|\psi\rangle = \cos\tfrac\theta2|{+z}\rangle + \sin\tfrac\theta2|{-z}\rangle. Find the full SzS_z statistics and the shot budget to distinguish this state from the θ=90°\theta = 90° state.

Step 1. Weights: P(+ℏ2)=cos⁡230°=34P(+\tfrac\hbar2) = \cos^2 30° = \tfrac34, P(−ℏ2)=14P(-\tfrac\hbar2) = \tfrac14.

Step 2. Mean: ⟨Sz⟩=ℏ2(34−14)=ℏ/4\langle S_z\rangle = \tfrac\hbar2\bigl(\tfrac34 - \tfrac14\bigr) = \boxed{\hbar/4}.

Step 3. Spread: Sz2=ℏ241S_z^2 = \tfrac{\hbar^2}{4}\mathbb 1 (both eigenvalues square to the same number), so ⟨Sz2⟩=ℏ24\langle S_z^2\rangle = \tfrac{\hbar^2}{4} in every state and σSz2=ℏ24−ℏ216=3ℏ216\sigma_{S_z}^2 = \tfrac{\hbar^2}{4} - \tfrac{\hbar^2}{16} = \tfrac{3\hbar^2}{16}: σSz=34ℏ≈0.433 ℏ\sigma_{S_z} = \tfrac{\sqrt3}{4}\hbar \approx \boxed{0.433\,\hbar}. Elegant closed form: σSz=ℏ2sin⁡θ\sigma_{S_z} = \tfrac\hbar2\sin\theta — spread is maximal on the equator, zero at the poles (machine-verified).

Step 4. Budget: the θ=90°\theta = 90° state has ⟨Sz⟩=0\langle S_z\rangle = 0. Separating means ℏ/4\hbar/4 apart at five standard errors with σ≈0.433ℏ\sigma \approx 0.433\hbar needs N=(5σ/Δ)2=(5⋅0.433/0.25)2=75N = (5\sigma/\Delta)^2 = (5\cdot0.433/0.25)^2 = \boxed{75} shots — a number any modern qubit readout burns in microseconds. Statistics, not single shots, is how states are told apart.

The man who bounded the tails

Origins · 1 minPafnuty Chebyshev and how this was discovered
PC
Pafnuty Chebyshev
1821–1894 · St Petersburg

Pafnuty Lvovich Chebyshev built the St Petersburg school that made probability a rigorous science, and his 1867 memoir On Mean Values proved the inequality bearing his name — the first theorem to extract a guarantee from a variance with no assumptions about the distribution behind it. His motivation was earthy: artillery tables, mechanism design (his linkages still steer), and a lifelong suspicion of unproven asymptotic folklore; his students Markov and Lyapunov industrialized the rigor into the modern limit theorems. Chebyshev never heard of quantum mechanics — he died a year before the electron was glimpsed — but his bound is one of the very few statements in this article that needed no quantum upgrade whatsoever: the Born rule hands each Hermitian operator a probability distribution over its spectrum, and Chebyshev's inequality applies verbatim, spectral weights in, tail guarantee out. When a quantum engineer asserts that at most a quarter of readouts can land beyond two sigma — whatever the device, whatever the state — she is citing a Russian mechanism-designer's 1867 theorem, unmodified across one and a half centuries and one complete revolution in physics.

History
1867
— Chebyshev's On Mean Values proves the distribution-free tail bound (Bienaymé's earlier version acknowledged)
1900
— Pearson coins "standard deviation," giving the spread its modern name and symbol
1926
— Born attaches probabilities to ∣⟨an∣ψ⟩∣2|\langle a_n|\psi\rangle|^2; quantum expectation values become weighted spectral means
1927
— Heisenberg's uncertainty paper makes σ the currency of quantum indeterminacy
1930
— Robertson's inequality bounds products of variances by commutators — the chapter's next stop

Going further

References. Griffiths & Schroeter, Introduction to Quantum Mechanics, 3rd ed., §1.4–1.5, §3.4 · Sakurai & Napolitano, Modern Quantum Mechanics, 2nd ed., §1.4 · Shankar, Principles of Quantum Mechanics, 2nd ed., Ch. 4 · Cohen-Tannoudji, Diu & Laloë, Quantum Mechanics, Vol. I, Ch. III · Chebyshev, Journal de mathématiques pures et appliquées 12, 177 (1867).

Provenance. All equations are standard textbook results. Verifier should recompute: (1) the spectral expansion ⟨ψ∣A^∣ψ⟩=∑nan∣cn∣2\langle\psi|\hat{A}|\psi\rangle=\sum_n a_n|c_n|^2 against Griffiths §3.4 / Sakurai §1.4; (2) the variance identity σA2=⟨A2⟩−⟨A⟩2\sigma_A^2=\langle A^2\rangle-\langle A\rangle^2 and its norm form; (3) reality of expectation values for Hermitian operators. For this edition all three were machine-executed (numpy/sympy) on random Hermitian matrices and states, plus this article's additions: the two-point variance identity σ2=p(1−p)ΔE2\sigma^2 = p(1-p)\Delta E^2 (symbolic, exact); the box example (E1=0.376E_1 = 0.376 eV at L=1L = 1 nm, ⟨H⟩=2.92E1=1.10\langle H\rangle = 2.92E_1 = 1.10 eV, σH=1.44E1=0.54\sigma_H = 1.44E_1 = 0.54 eV, Chebyshev tails 0.36≤9/160.36 \le 9/16 at k=4/3k=4/3 and 0≤1/40 \le 1/4 at k=2k=2); the tilted-spin example (P±=3/4,1/4P_\pm = 3/4, 1/4; ⟨Sz⟩=ℏ/4\langle S_z\rangle = \hbar/4; σ=34ℏ=ℏ2sin⁡θ\sigma = \tfrac{\sqrt3}{4}\hbar = \tfrac\hbar2\sin\theta; N≈75N \approx 75 for 55-standard-error separation); Chebyshev on random discrete distributions; and the empirical σ/N\sigma/\sqrt N standard-error check at N=20736N = 20736. Per the chapter ownership map: reality of ⟨A^⟩\langle\hat A\rangle is Hermitian Operators and Observables' theorem (recalled), the σ=0⇔\sigma = 0 \Leftrightarrow eigenstate converse belongs to the wave chapter's Standard Deviation and Quantum Uncertainty (recalled by title), Born probabilities to Born Rule and Measurement Probabilities, and the mixed-state average Tr(ρA^)\mathrm{Tr}(\rho\hat A) to Density Operator and Mixed States ahead — this article owns the spectral-moments machinery, the norm form, and the statistical guarantees.

Builds on: Hermitian Operators and Observables · Born Rule and Measurement Probabilities · Inner Product and Norm of States · Completeness Relation and Resolution of Identity · Eigenvalues and Eigenstates

Leads to: Generalized Uncertainty Principle · Ehrenfest's Theorem · Measurement and Wavefunction Collapse · Density Operator and Mixed States

Is ⟨Â⟩ what I get if I measure the same particle many times?

No — that experiment measures the collapse postulate, not the state. After the first measurement the particle is in an eigenstate, and every subsequent measurement of the same observable repeats the first answer with probability 1. The expectation value is an average over fresh copies: prepare, measure once, discard, repeat. Ensemble language is not pedantry; it is the difference between statistics of ∣ψ⟩|\psi\rangle and statistics of the update rule.

Why is the variance defined with squares instead of absolute deviations?

Three compounding reasons. Squares make the algebra close: ⟨(A^−⟨A^⟩)2⟩\langle(\hat A - \langle\hat A\rangle)^2\rangle expands into moments, while ⟨∣A^−⟨A^⟩∣⟩\langle|\hat A - \langle\hat A\rangle|\rangle requires spectral surgery to even define. Squares turn variance into a norm (equation 2), inheriting all of inner-product geometry — non-negativity, the eigenstate criterion, Cauchy–Schwarz. And squares are what the uncertainty principle needs: Robertson's bound is a statement about ∥ΔA^ψ∥ ∥ΔB^ψ∥\|\Delta\hat A\psi\|\,\|\Delta\hat B\psi\|. Mean absolute deviation is a legitimate statistic; it just buys none of this machinery.

Can two different states have identical ⟨Â⟩ and σ_A?

Easily — even identical full statistics of one observable. Any relative phase between energy eigenstate components is invisible to every ⟨H^k⟩\langle\hat H^k\rangle: (3∣1⟩+4∣2⟩)/5(3|1\rangle + 4|2\rangle)/5 and (3∣1⟩+4i∣2⟩)/5(3|1\rangle + 4i|2\rangle)/5 share every energy moment forever. The phase shows up in the statistics of observables that don't commute with H^\hat H (position, say). One observable's histogram never determines the state; tomography — reconstructing ∣ψ⟩|\psi\rangle or ρ from many observables' statistics — exists precisely because of this.

Does ⟨Â⟩ have to be a real number even in a superposition?

Yes, for any Hermitian A^\hat A and any state — that is Theorem 3 of the Hermiticity article, and equation (1) re-exhibits it: real eigenvalues, non-negative weights, real sum. If a calculation hands you a complex expectation value, an error upstream is guaranteed — a non-Hermitian operator slipped in (measure x^p^\hat x\hat p without symmetrizing and you'll see iℏ/2i\hbar/2's worth of complex part) or a conjugation was dropped in the sandwich.

How do I compute ⟨Â⟩ if I can't diagonalize Â?

That is the sandwich's whole point: ⟨ψ∣A^∣ψ⟩\langle\psi|\hat A|\psi\rangle needs matrix elements in any basis you like — ∑mncm∗Amncn\sum_{mn} c_m^* A_{mn} c_n — no spectrum required. Diagonalization buys the probability-distribution reading (equation 1), not the number. In practice one often goes the other way: hardware estimates ⟨A^⟩\langle\hat A\rangle by sampling, precisely because diagonalizing the operator classically is the expensive step.

Is Chebyshev ever tight, or always a loose overestimate?

It is tight exactly for the distribution that puts weight 1/k21/k^2 at ±kσ\pm k\sigma and the rest at the mean — a legal quantum state on a three-eigenvalue observable, so no better model-free bound exists. Real spectra usually beat it enormously (Gaussian tails at 2σ2\sigma: 4.6%4.6\% against the guaranteed 25%25\%). Use Chebyshev when you know only σ; use the actual weights when you have them — as in the worked example, where the exact tail at 2σ2\sigma is zero.

What replaces ⟨ψ|Â|ψ⟩ when the preparation itself is random?

The density operator: ⟨A^⟩=Tr(ρA^)\langle\hat A\rangle = \mathrm{Tr}(\rho\hat A), where ρ blends quantum weights and classical preparation ignorance in one object. The formula reduces to the sandwich for a pure ρ, and the variance machinery carries over verbatim. That upgrade — and why two very different preparations can share every statistic — is the business of Density Operator and Mixed States, four serials ahead.

Before this

Where this leads