For a density operator ρ and a bounded observable A, the expectation value is
⟨A⟩ρ=Tr(ρA).
For a projective outcome a with projector Pa,
p(a)=Tr(ρPa).
For a general measurement effect Ei,
p(i)=Tr(ρEi).
These are not three unrelated rules. The probability formulas are trace
rules applied to effects, and the expectation formula is the
probability-weighted average of the outcomes of an observable. Together
they extend the pure-state Born rule to pure states, randomized ensembles,
open subsystems, and general measurements.
The derivations below use finite matrices. The final section explains what changes for unbounded observables such as position and momentum.
Helpful background. Density operators explains positive, trace-one states; expectation values explains the average of measurement outcomes.
In a finite-dimensional Hilbert space, the trace of an operator X is
TrX=n∑⟨n∣X∣n⟩,
where {∣n⟩} is any orthonormal basis.
Let another orthonormal basis be related by
∣m′⟩=n∑Unm∣n⟩
for a unitary matrix U. Then
m∑⟨m′∣X∣m′⟩=m,n,k∑Unm∗Ukm⟨n∣X∣k⟩=n,k∑δnk⟨n∣X∣k⟩=n∑⟨n∣X∣n⟩.
The trace may be calculated in any convenient basis without changing the
answer.
For finite matrices,
Tr(XY)=Tr(YX),
and
Tr(XYZ)=Tr(ZXY)=Tr(YZX).
Cyclicity permits cyclic rotations, not arbitrary reordering. In general,
Tr(XYZ)=Tr(XZY).
This distinction matters when observables and states do not commute.
For any vectors ∣u⟩,∣v⟩ and operator A,
Tr(∣u⟩⟨v∣A)=⟨v∣A∣u⟩.
To verify it, insert an orthonormal basis:
Tr(∣u⟩⟨v∣A)=n∑⟨n∣u⟩⟨v∣A∣n⟩=⟨v∣A(n∑∣n⟩⟨n∣)∣u⟩=⟨v∣A∣u⟩.
This identity is the cleanest bridge between trace notation and bra–ket
notation.
A normalized pure state has
ρψ=∣ψ⟩⟨ψ∣.
The rank-one identity gives
Tr(ρψA)=Tr(∣ψ⟩⟨ψ∣A)=⟨ψ∣A∣ψ⟩.
The density-operator rule therefore reproduces the familiar pure-state
expectation value exactly.
For a rank-one outcome
Pϕ=∣ϕ⟩⟨ϕ∣,
the same identity gives
Tr(ρψPϕ)=∣⟨ϕ∣ψ⟩∣2.
This is the ordinary Born probability.
In a chosen orthonormal basis,
Tr(ρA)=i∑(ρA)ii=i,j∑ρijAji.
This formula is useful for direct matrix calculations. It also shows that
off-diagonal entries of ρ contribute whenever A has matching
off-diagonal matrix elements.
If the basis diagonalizes A,
A=a∑aPa,
then
⟨A⟩ρ=a∑aTr(ρPa).
For a nondegenerate eigenbasis, this becomes
⟨A⟩ρ=a∑aρaa.
In a nondegenerate measurement eigenbasis, each diagonal entry is one outcome probability. For a degenerate eigenvalue, add the entries belonging to its entire eigenspace.
If
ρ=i∑pi∣ψi⟩⟨ψi∣,
then linearity gives
Tr(ρA)=i∑piTr(∣ψi⟩⟨ψi∣A)=i∑pi⟨ψi∣A∣ψi⟩.
The trace rule combines quantum expectation within each preparation branch
with the classical average over branches. Different ensembles with the
same ρ necessarily give the same expectation for every A.
Let the spectral decomposition of a Hermitian observable be
A=a∑aPa.
The outcome probabilities are
p(a)=Tr(ρPa),
and therefore
a∑ap(a)=a∑aTr(ρPa)=Tr(ρA).
The expectation is an ensemble average over possible outcomes. It need not
itself be an eigenvalue or a possible result of one trial.
For any function f defined on the spectrum,
⟨f(A)⟩ρ=Tr[ρf(A)]=a∑f(a)p(a).
In particular,
⟨An⟩ρ=Tr(ρAn),
and the variance is
Varρ(A)=⟨(A−⟨A⟩ρI)2⟩ρ=Tr(ρA2)−[Tr(ρA)]2.
If A=A†, then Tr(ρA) is real:
Tr(ρA)∗=Tr[(ρA)†]=Tr(Aρ)=Tr(ρA).
If the spectrum lies between amin and amax, then
amin≤⟨A⟩ρ≤amax.
This follows because the expectation is a convex average of the
eigenvalues. Likewise,
Varρ(A)≥0
because it is the expectation of a positive operator.
These inequalities are powerful error checks. An answer outside the
spectral range or a negative variance signals a calculation or
normalization mistake.
For projectors satisfying
PaPb=δabPa,a∑Pa=I,
the trace rule gives
p(a)=Tr(ρPa).
The probabilities are nonnegative because both ρ and Pa are
positive. They are normalized:
a∑p(a)=Tr(ρa∑Pa)=Trρ=1.
For a degenerate outcome, Pa projects onto the full eigenspace. The
probability is the sum of the density-matrix populations in any
orthonormal basis of that eigenspace.
A general POVM has effects
Ei≥0,i∑Ei=I.
Its outcome probabilities are
p(i)=Tr(ρEi).
To see nonnegativity directly, write
Tr(ρEi)=Tr(ρ1/2Eiρ1/2)≥0,
because ρ1/2Eiρ1/2 is positive. Completeness again gives
i∑p(i)=1.
The effects determine outcome probabilities. They do not alone determine
the conditional output states of the measured system; that requires an instrument. See
POVMs: First Encounter
and Generalized Measurements Overview.
For a joint state ρAB, an observable local to A is
MA⊗IB.
If
ρA=TrBρAB,
then
TrAB[ρAB(MA⊗IB)]=TrA(ρAMA).
This equality is the defining operational property of the partial trace:
the reduced state reproduces every trace-rule prediction local to the
subsystem. Correlation observables such as A⊗B still require the
joint state.
See Reduced Density Matrices
for the construction and
Subsystems and Local Observables
for the operator embedding.
Write a general qubit density matrix as
ρ=(pc∗c1−p).
Using the Pauli matrices,
⟨X⟩ρ⟨Y⟩ρ⟨Z⟩ρ=2Rec,=−2Imc,=2p−1.
The Z expectation depends on the populations, while X and Y expose
the real and imaginary parts of the coherence.
Equivalently, if
ρ=21(I+r⋅σ)
and
A=a0I+a⋅σ,
then
⟨A⟩ρ=a0+r⋅a.
This compact formula follows from Tr(σiσj)=2δij.
For example, take
ρ=(0.60.2−0.1i0.2+0.1i0.4),A=2I+3Z.
The Bloch vector is (0.4,−0.2,0.2), whose squared length is 0.24<1, so this is a valid mixed state. The two possible readings of A are 5 and −1, with probabilities 0.6 and 0.4. Thus
⟨A⟩=0.6(5)+0.4(−1)=2.6,Var(A)=9(1−0.22)=8.64.
The mean lies between the possible readings, but is not itself a reading.
For 0≤η≤1, define two effects
E±=21(I±ηZ).
They are positive and satisfy E++E−=I. If the state’s Bloch component
is
rz=Tr(ρZ),
then
p(±)=21(1±ηrz).
At η=1, this is the projective Z measurement. At η=0, both
outcomes have probability 1/2 regardless of the state. Intermediate
values model a noisy or unsharp binary measurement at the level of
effects. If the recorded numbers are +1 and −1, their mean is ηrz and their second moment is 1. The first-moment operator is ηZ, but its square is η2I, not the measurement’s second-moment operator I. For a POVM use ∑ixinEi for the nth moment of the recorded values xi; powers of one observable describe its spectral measurement.
In an infinite-dimensional Hilbert space, a density operator is trace
class. If A is bounded, then ρA is trace class and
Tr(ρA) is well-defined.
For an unbounded self-adjoint A, start with its spectral projections PA(Δ). They define the probability measure
μρ(Δ)=Tr[ρPA(Δ)].
A finite expectation exists when ∫∣a∣dμρ(a)<∞, and then ⟨A⟩ρ=∫adμρ(a). The notation Tr(ρA) is often used for this spectral average, but interpreting it as the trace of an ordinary operator product requires additional conditions.
For a pure state, finite absolute first moment means ψ∈D(∣A∣1/2); it need not imply ψ∈D(A). Finite second moment means ψ∈D(A) and gives ⟨A2⟩=∥Aψ∥2, without requiring ψ∈D(A2). Thus “the mean exists” and “the vector Aψ exists” are different assertions. See Expectation values for the spectral formulation.
Cyclicity is safe for a bounded operator times a trace-class operator, and for two Hilbert–Schmidt factors. Unbounded factors require separate domain and convergence checks; finite-dimensional rearrangements alone do not justify them.
The representation-independent formulation is developed in
States as Positive Linear Functionals.
Cyclic does not mean commutative. A trace permits cyclic rotation of finite matrix factors, not an arbitrary exchange of two factors.
A mean is not a single outcome. Check the eigenvalues to identify possible readings, and use the trace to average their probabilities.
Coherences can contribute. Diagonal populations suffice when the observable is diagonal in the same basis. Otherwise retain the off-diagonal terms in ∑ijρijAji.
Local and joint predictions differ. A reduced state determines a local observable; a correlation between two subsystems generally needs their joint state.
- Prove the rank-one trace identity
Tr(∣u⟩⟨v∣A)=⟨v∣A∣u⟩.
Solution
Insert an orthonormal basis:
Tr(∣u⟩⟨v∣A)=n∑⟨n∣u⟩⟨v∣A∣n⟩=⟨v∣A(n∑∣n⟩⟨n∣)∣u⟩=⟨v∣A∣u⟩.
- Starting from matrices, show that
Tr(ρA)=i,j∑ρijAji.
Solution
By matrix multiplication,
(ρA)ii=j∑ρijAji.
Summing the diagonal entries gives
Tr(ρA)=i∑(ρA)ii=i,j∑ρijAji.
- Let A have smallest and largest eigenvalues
amin,amax. Prove that every density operator obeys
amin≤Tr(ρA)≤amax.
Solution
With A=∑aaPa, define
p(a)=Tr(ρPa).
These probabilities are nonnegative and sum to one. Therefore
Tr(ρA)=a∑ap(a)
is a convex average of the eigenvalues and lies between their minimum and
maximum.
- Show that
Varρ(A)=Tr(ρA2)−Tr(ρA)2
is nonnegative.
Solution
Let
δA=A−⟨A⟩ρI.
Because (δA)2 is positive,
Tr[ρ(δA)2]≥0.
Expanding and using Trρ=1 gives
Tr[ρ(δA)2]=Tr(ρA2)−Tr(ρA)2.
Thus the variance is nonnegative.
- Prove that a POVM {Ei} gives normalized, nonnegative
probabilities.
Solution
For each effect,
p(i)=Tr(ρ1/2Eiρ1/2)≥0
because the operator inside the trace is positive. Completeness gives
i∑p(i)=Tr(ρi∑Ei)=Trρ=1.
- For
ρ=(pc∗c1−p),
derive the three Pauli expectations.
Solution
Direct multiplication gives
Tr(ρX)Tr(ρY)Tr(ρZ)=c+c∗=2Rec,=i(c−c∗)=−2Imc,=p−(1−p)=2p−1.
The signs agree with the convention
Y=(0i−i0).
- An unsharp detector has effects E±=(I±ηZ)/2 and records the numbers ±1. For η=3/5 and ⟨Z⟩=1/5, calculate its outcome probabilities, mean, and variance. Compare the variance with that of a spectral measurement of the operator M=ηZ on the same state. Why do the means agree but the variances differ?
Solution
The probabilities are p(+)=14/25 and p(−)=11/25. Thus the recorded mean is 3/25, the second moment is one, and
Var(x)=1−(3/25)2=625616.
For a spectral measurement of M, the possible values are ±3/5, with probabilities 3/5 and 2/5. Its mean is again 3/25, but
Var(M)=η2−η2⟨Z⟩2=625216.
The first-moment operator ∑±(±1)E±=M determines the mean, but the detector’s second-moment operator is ∑±(±1)2E±=I, rather than M2. The extra readout variance is 1−η2=16/25. At η=1 the two measurements coincide; at η=0 the detector still outputs a fair random sign while M=0 always reads zero.
- Verify the reduced-state identity in a product basis:
TrAB[ρAB(MA⊗IB)]=TrA(ρAMA).
Solution
Write the joint matrix elements as
ρiμ,jν=⟨i,μ∣ρAB∣j,ν⟩.
Then
TrAB[ρAB(MA⊗IB)]=i,j,μ∑ρiμ,jμ(MA)ji.
The reduced-state entries are
(ρA)ij=μ∑ρiμ,jμ.
Substitution gives
i,j∑(ρA)ij(MA)ji=TrA(ρAMA).
- L. E. Ballentine, Quantum Mechanics: A Modern Development, 2nd ed., World Scientific (2014), Ch. 3.
- A. S. Holevo, Probabilistic and Statistical Aspects of Quantum Theory, 2nd ed., Edizioni della Normale (2011), Ch. 2.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press (2010), Secs. 2.2 and 2.4.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018), Ch. 2.