Measuring all qubits one at a time, in any order, yields j with probability |α_j|²
ProvedQAlgorithms.Nannicini.seqMeasProb_eq_probLet be a -qubit quantum state (a unit vector). A single-qubit measurement gate on qubit (Postulate 3) outputs with probability , after which the state collapses to . Let be any ordering of the qubits, and measure the qubits one at a time in the order , each measurement acting on the state left by the previous ones. Then for every , the probability that the outcomes are is
Thus measuring all qubits sequentially with single-qubit measurement gates is the same as one measurement of the whole register in the computational basis.
Formalization Note The sequential probability is the product of the successive conditional outcome probabilities, each computed on the collapsed state. When an intermediate outcome has probability zero, the collapse formula divides by zero (Lean returns the zero vector); the product is then zero, as is .
import Definitions.Def_QAlgorithms_Defs_Measurement set_option autoImplicit false
namespace QAlgorithms.Nannicini
/-- Nannicini p.19, Proposition 1.27: for a `q`-qubit state `|ψ⟩ = ∑_j α_j |j⟩`, measuring the
`q` qubits one at a time with the single-qubit measurement gate of Postulate 3 (outcome
probability, then collapse and renormalization), in any order, yields the string `j` with
probability `|α_j|²`. The order is a permutation `σ` of the qubits: qubit `σ 0` is measured
first, then `σ 1`, and so on. -/
theorem seqMeasProb_eq_prob {q : ℕ} (ψ : EuclideanSpace ℂ (Qubits q)) (hψ : IsState ψ)
(σ : Equiv.Perm (Fin q)) (j : Qubits q) :
seqMeasProb ψ (List.ofFn fun i => σ i) j = prob ψ j := by
sorry
end QAlgorithms.Nannicini
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a natural number, with allowed. Let be a unit vector, . Let be any permutation of the wire set , and let be a bit string.
Collapse. For a vector , a wire and a bit , let . The collapsed vector has entries
If , the reciprocal is taken to be , so the collapsed vector is the zero vector.
Sequential measurement probability. For a list of wires , define recursively:
- the empty list gives value ;
- the list applied to gives times the value of applied to .
The theorem states that the sequential measurement probability of , for the wire order and target outcome , equals . This is the probability of when is measured in the computational basis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.