POVMs & Generalized Measurement
POVMs & Generalized Measurement
Projective measurement is not the most general thing you can do to a quantum state. If you let the system interact with an ancilla, measure that projectively, and forget the ancilla, the statistics seen by the original system obey a richer rule — a POVM. This is the measurement formalism that appears whenever the world is realistic: noisy detectors, partial information, optimal discrimination of states that overlap. We build it from measurement operators, prove projective measurement is the special case, and use a POVM to do something projective measurement cannot: cleanly handle non-orthogonal states.
Learning Objectives
After this lesson you will be able to:
- State the general measurement postulate in terms of measurement operators with , and compute outcome probabilities and post-measurement states.
- Define POVM elements with , and explain what a POVM does and does not determine.
- Show projective measurement is the special case (orthogonal projectors).
- State Naimark's dilation theorem: every POVM is a projective measurement on a larger space.
- Construct a 2-state discrimination POVM for non-orthogonal states (unambiguous discrimination) and explain why projective measurement is insufficient.
Intuition
A projective measurement is a clean, repeatable question with orthogonal answers. But many real "measurements" are not like that. A photon detector clicks or doesn't, with efficiency . You couple a qubit weakly to a meter and read a noisy pointer. You are handed one of two non-orthogonal states and asked to guess which — and you would rather sometimes answer "I don't know" than be wrong.
All of these are captured by allowing the measurement to be a projective measurement on a bigger system: append an ancilla in a known state, apply a joint unitary (let them interact), then measure the ancilla projectively. From the original system's point of view, the resulting outcome probabilities are not of the form for orthogonal — they are for a family of positive operators that sum to the identity but need not be orthogonal, need not be projectors, and can even outnumber the dimension. That family is a POVM, and Naimark's theorem says the "bigger system" story is always available: POVMs are exactly the shadows of projective measurements.
Theory
General measurement operators
General measurement postulate. A measurement is described by a collection of measurement operators acting on the system's Hilbert space, indexed by the outcomes , satisfying the completeness relation
Measuring state yields outcome with probability
and the post-measurement state, given outcome , is
These are valid probabilities: , and completeness gives . Note the post-measurement state depends on the operator , not just on the probability — and two different can produce the same probabilities but different collapses (see below).
POVM elements
Define, for each outcome,
Each is positive semidefinite (, since — it has the form , 0.1.6), and the completeness relation becomes
Definition (POVM). A Positive Operator-Valued Measure is a set of positive operators with and . The outcome probabilities are
What a POVM determines, and what it doesn't. The POVM fixes the outcome statistics for every state — that is all probabilities ever depend on. It does not fix the post-measurement state: given , any with unitary satisfies (polar freedom). So if you only care about outcome probabilities — as in state discrimination, tomography, and estimation — the POVM is the complete description, and you never need to name the . When you also need the post-measurement state (e.g. feed-forward), you must specify the .
Projective measurement is the special case
Take , a complete set of orthogonal projectors (Lesson 1). Then since and ,
so the POVM elements are the projectors themselves, , and the collapse is exactly the projection postulate. Projective measurements are precisely the POVMs whose elements are orthogonal projectors (). The defining extra structure that general POVMs drop is orthogonality and idempotence of the elements — a general need be neither a projector nor orthogonal to the others.
Two structural freedoms a POVM has that a projective measurement does not:
- More outcomes than dimensions. A qubit () admits projective measurements with at most outcomes (rank-1) or (the trivial ). A POVM on a qubit can have , , … outcomes — e.g. the symmetric "trine" of three sub-normalized projectors at , each , summing to . This is impossible projectively.
- Non-repeatability. need not be idempotent, so re-measuring need not reproduce the outcome. Generalized measurements are not, in general, repeatable.
Why POVMs are the most general: Naimark dilation
The claim that POVMs are the most general measurement is a theorem, not a definition.
Naimark's dilation theorem. Every POVM on a system can be realized as a projective measurement on a larger space: there is an ancilla in a fixed state , a joint unitary on , and an orthogonal projective measurement on the enlarged space such that
Idea of the construction. Choose . Define an isometry by , where is an orthonormal ancilla basis. Then , so is an isometry and extends to a unitary on the joint space (with ). Measuring the ancilla with gives, by the mixed-product rule, . ∎ (sketch)
Conversely — and this is the half that makes "most general" precise — any physical measurement (append ancilla in a known state, apply a unitary, measure projectively, and read the marginal statistics on the system) produces probabilities of the form for some POVM. Proof of the converse. Let the system start in , ancilla in , joint unitary , and ancilla projective measurement with orthogonal projectors on . The outcome- probability is
where acts on alone. Each is positive (it is a "compression" of the projector : ) and they sum to because and . So the marginal statistics are exactly a POVM. ∎
Together the two directions say: the POVMs are exactly the achievable measurements — no more, no less. This is the operational reason the formalism stops at POVMs. (The same enlarge-and-forget logic gives Kraus operators for noisy channels in Term 4.1; a measurement is a channel with a classical output.)
Application: discriminating non-orthogonal states
Lesson 1 proved orthogonal states are perfectly distinguishable and non-orthogonal states are not. POVMs let us still do something useful and error-controlled with non-orthogonal states. We treat unambiguous state discrimination (USD): never answer wrongly, at the price of sometimes answering "don't know".
Suppose we are given either or (equiprobable, both known to us, with ). Use a 3-outcome POVM :
- fires only when the state is — wait, we orient it the standard way: outcome means "definitely ", outcome means "definitely ", and means "inconclusive". To never err, must be orthogonal to (so it can never fire on ), and orthogonal to .
Let be a unit vector with , and likewise . Set
with constants chosen as large as possible while keeping (it must remain a valid POVM element). By construction and — no error is ever made. The probability of a conclusive, correct identification of is .
For the symmetric real case with overlap , optimizing subject to gives the celebrated Ivanovic–Dieks–Peres (IDP) bound: the optimal inconclusive probability is exactly the overlap,
As (nearly orthogonal) we almost always succeed; as (nearly identical) we almost always abstain — exactly the right limiting behavior. A 2-outcome projective measurement cannot achieve zero error here: its two rank-1 projectors are orthogonal, so at most one of them can be orthogonal to a given , and the other necessarily has nonzero overlap with the "wrong" state, forcing a nonzero error probability. The third ("don't know") outcome — unavailable projectively on a qubit — is what buys zero error. We construct this POVM explicitly in code below.
Worked Examples
Example 1 — A non-projective qubit POVM (the "trine")
Let for — three real states at on the Bloch sphere's great circle. Define
Positivity. Each is times a rank-1 projector, hence . ✓
Completeness. Using and (three cube-roots-of-unity directions sum to zero):
This is a legitimate 3-outcome measurement on a 2-dimensional system — impossible for a projective measurement, which on a qubit has at most outcomes. (The trine is the optimal POVM for several qubit estimation tasks; verified numerically below.)
Example 2 — Unambiguous discrimination of and
Take and , with overlap .
The orthogonal complements: (since ) and (since ). The USD POVM is
with as large as possible keeping . Working out the constraint (or quoting IDP), the optimum is , giving an inconclusive probability and success .
Zero error, by construction. If the state is : $\langle+|E_0|+\rangle = c|\langle-|+\rangle|^2 = 000|0\rangle$. Symmetrically, outcome never fires on . The price of certainty is the of runs that come back "don't know". The NumPy code below builds these , checks and , and simulates the statistics to confirm zero error.
Hands-on (Python)
We implement a general POVM, verify completeness and positivity, and simulate outcome statistics — first the trine, then unambiguous discrimination.
import numpy as np
ket0 = np.array([1, 0], dtype=complex)
ket1 = np.array([0, 1], dtype=complex)
plus = (ket0 + ket1) / np.sqrt(2)
minus = (ket0 - ket1) / np.sqrt(2)
def is_povm(elements, tol=1e-9):
"""Check E_m >= 0 (Hermitian, nonneg eigenvalues) and sum_m E_m = I."""
d = elements[0].shape[0]
total = np.zeros((d, d), dtype=complex)
for E in elements:
assert np.allclose(E, E.conj().T), "POVM element not Hermitian"
w = np.linalg.eigvalsh((E + E.conj().T) / 2)
assert np.all(w >= -tol), f"POVM element not PSD: min eig {w.min():.2e}"
total += E
return np.allclose(total, np.eye(d), atol=tol)
def povm_probabilities(psi, elements):
"""p_m = <psi|E_m|psi>."""
return np.array([np.real(psi.conj() @ (E @ psi)) for E in elements])
def sample_povm(psi, elements, shots, rng):
"""Sample outcome labels 0..M-1 from the POVM distribution."""
p = povm_probabilities(psi, elements)
return rng.choice(len(elements), size=shots, p=p)
# ---- The trine POVM: 3 outcomes on a qubit (impossible projectively) -----
trine_states = [
np.array([np.cos(2*np.pi*m/3), np.sin(2*np.pi*m/3)], dtype=complex)
for m in range(3)
]
trine = [(2/3) * np.outer(s, s.conj()) for s in trine_states]
print("Trine is a valid POVM:", is_povm(trine)) # True
print("Sum E_m =\n", np.round(sum(trine).real, 6)) # identity
print("Probs on |0>:", np.round(povm_probabilities(ket0, trine), 4)) # sums to 1# ---- Unambiguous discrimination of |0> and |+> ---------------------------
s = abs(ket0.conj() @ plus) # overlap = 1/sqrt(2)
c = 1 / (1 + s) # IDP-optimal weight
E0 = c * np.outer(minus, minus.conj()) # fires only for |0> (orthogonal to |+>)
E1 = c * np.outer(ket1, ket1.conj()) # fires only for |+> (orthogonal to |0>)
E_inc = np.eye(2) - E0 - E1 # "don't know"
usd = [E0, E1, E_inc]
print("USD is a valid POVM:", is_povm(usd)) # True
print("E_? eigenvalues (must be >=0):", np.round(np.linalg.eigvalsh(E_inc), 6))
# Zero error: outcome 0 never fires on |+>, outcome 1 never fires on |0>
print("P(say '0' | state |+>) =", np.round(povm_probabilities(plus, usd)[0], 6)) # 0
print("P(say '1' | state |0>) =", np.round(povm_probabilities(ket0, usd)[1], 6)) # 0
# Inconclusive probability hits the IDP bound = overlap s
print(f"P(?) = {povm_probabilities(ket0, usd)[2]:.4f}, overlap s = {s:.4f}") # equal# ---- Monte-Carlo: confirm zero error over many shots ---------------------
rng = np.random.default_rng(7)
shots = 100_000
# Prepare |0> half the time, |+> the other half; record (truth, outcome)
errors = 0
labels = {0: "say-0", 1: "say-1", 2: "say-?"}
for truth, state in [(0, ket0), (1, plus)]:
outcomes = sample_povm(state, usd, shots, rng)
# an ERROR is a confident-but-wrong report: say-1 when truth=0, or say-0 when truth=1
wrong = (outcomes == 1) if truth == 0 else (outcomes == 0)
errors += int(wrong.sum())
print("Confident-but-wrong reports over 200k shots:", errors) # 0 -> unambiguousThe empirical error count is exactly zero because the orthogonality constraints are built into the operators — the simulation confirms the analytic guarantee rather than discovering it. All probability and completeness checks are done in NumPy; a POVM is implemented on hardware via Naimark dilation (ancilla + joint unitary + computational-basis read-out), which we revisit with Braket in Term 2.
Exercises
E1 (easy). Verify directly that the trine from Example 1 satisfies for the explicit states , , .
Solution
Compute outer products: |\phi_0\rangle\langle\phi_0| = \begin{psmallmatrix}1&0\\0&0\end{psmallmatrix}, and |\phi_1\rangle\langle\phi_1| = \begin{psmallmatrix}1/4 & -\sqrt3/4\\ -\sqrt3/4 & 3/4\end{psmallmatrix}, |\phi_2\rangle\langle\phi_2| = \begin{psmallmatrix}1/4 & \sqrt3/4\\ \sqrt3/4 & 3/4\end{psmallmatrix}. Their sum is \begin{psmallmatrix}3/2 & 0\\ 0 & 3/2\end{psmallmatrix} = \tfrac32 I. Multiply by : . ✓
E2 (easy). Show that if all in a POVM are orthogonal projectors then the post-measurement update (for ) is repeatable, but that a general POVM need not be.
Solution
If is a projector, , and we are back in the projective case: re-measuring gives the same outcome with certainty (Lesson 1 repeatability proof). For a general element such as a trine , is not idempotent (), so for the collapsed state in general — outcomes are not guaranteed to repeat. ∎
E3 (medium). Prove that any POVM element satisfies (i.e. its eigenvalues lie in ). Why does this make a probability for every state?
Solution
by definition. For the upper bound, (a sum of positive operators is positive), so . Hence every eigenvalue of satisfies . Then for any unit , , so ; and by completeness. ∎
E4 (medium). Given a POVM , show that infinitely many measurement-operator sets realize it, and characterize them.
Solution
We need . One solution is (the positive square root). For any unitaries , also works: $M_m'^\dagger M_m' = \sqrt{E_m}U_m^\dagger U_m\sqrt{E_m} = \sqrt{E_m}\sqrt{E_m} = E_mM_m^\dagger M_m=E_m$ then by polar decomposition for some unitary (or partial isometry) . So the realizations are exactly — they share all outcome probabilities but differ in the post-measurement state. ∎ (This is why a POVM, not a set of , is the right object when only statistics matter.)
E5 (hard). For unambiguous discrimination of two equiprobable states with real overlap , prove that the inconclusive probability cannot be below , so the IDP value is optimal.
Solution
A USD POVM requires and ; positivity then forces and (rank ≤ 1, supported on the orthogonal complements), with . The success probabilities are and likewise . The constraint caps : a positivity computation (or Lagrange optimization with the equiprobable objective) gives , so each conclusive probability is averaged appropriately, and . Lower would require or beyond the positivity cap, breaking . Hence . ∎ (Full optimization: [NC, §2.2.6 / Box 2.5] and the IDP references.)
E6 (hard). Carry out the Naimark construction for the trine: build the isometry $V|\psi\rangle = \sum_{m=0}^2 (\sqrt{E_m}|\psi\rangle)\otimes|m\rangleV^\dagger V=I$, and explain how a projective measurement of the qutrit ancilla reproduces the trine statistics.
Solution
With , define ,
(where are orthonormal qutrit kets). Then
, so is an
isometry (extend to a unitary on the 6-dim space). Measuring the ancilla with
gives — the trine
probabilities. The verification (numerically: assemble , check V.conj().T @ V ≈ I_2, and compare
to povm_probabilities) is a direct extension of the Hands-on code. This is how a
POVM runs on hardware: dilate to a projective measurement on system+ancilla. ∎
Checkpoint
- State the general measurement postulate: the operators, the completeness relation, the probability, and the post-measurement state.
- Define a POVM and explain precisely what it determines and what it does not.
- Show that projective measurement is the special case of a POVM, and name the extra structure projectors have.
- What does Naimark's theorem assert, and why does it make "POVM" the most general measurement?
- Why can a POVM but not a projective measurement give a qubit measurement with outcomes?
- In unambiguous discrimination, what role does the third ("don't know") outcome play, and what is the minimum inconclusive probability for overlap ?
Answers
- Operators with ; outcome with ; post-measurement state .
- A POVM is with , . It determines all outcome probabilities (or ) but not the post-measurement state — that needs a choice of .
- Set (orthogonal projectors): , giving and projective collapse. The extra structure is orthogonality/idempotence: .
- Every POVM is realizable as a projective measurement on system+ancilla (dilation), and conversely every ancilla-assisted projective measurement yields a POVM on the system — so POVMs are exactly the achievable measurements.
- A qubit's projective measurements have at most (rank-1) orthogonal outcomes; POVM elements need not be orthogonal, so you can have positive operators (e.g. the trine) summing to .
- The "don't know" outcome absorbs the ambiguity so the other two outcomes can be made orthogonal to the "wrong" state — enabling zero error. The minimal inconclusive probability is .
Further Reading
- [NC] Nielsen & Chuang, §2.2.3–2.2.6 — general measurements, POVMs, and the discrimination / distinguishability discussion (Box 2.5).
- [Pre] Preskill, Ph219, Ch. 3 — generalized measurements, the Naimark/dilation picture, and the link to quantum channels.
- [Wat] Watrous, The Theory of Quantum Information, Ch. 2–3 — measurements as a special case of channels, rigorous treatment of POVMs and Naimark's theorem.
← Prev: Expectation & Uncertainty · Up: Term 1 · Next: Multi-Qubit States →