Lemma 8: composite probability, closure, commutation and independence
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.measurement_compositionFix an orthogonal family with support . A measurement acts on each subspace by the identity on the measured system and an ancillary unitary , with a specified output subregister. For any normalized ,
Products of measurement operators remain measurement operators. Operators with disjoint ancillary registers commute, even though they share the measured system. For two such measurements,
The independence is conditional on , not unconditional independence for a superposition of eigenspaces.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
noncomputable section
open scoped Matrix ComplexConjugate Kronecker
namespace QAlgorithms.Papers.Independent.Intakethird100.P03
open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)
attribute [local instance] Classical.propDecidable
/-- PDF pp.16–17, Lemma 8, all clauses: mixture probabilities, closure under products,
commutation on disjoint ancillary registers, and independence conditional on the eigenspace.
The measured system I is shared. -/
theorem measurement_composition {I : Type*} [Fintype I] [DecidableEq I]
(r d m e t : ℕ) (O : OrthogonalProjectorFamily I r)
(V W : Fin r → Matrix (Qubits d) (Qubits d) ℂ)
(Z : Fin r → Matrix (Qubits e) (Qubits e) ℂ)
(C : Fin m ↪ Fin d) (D : Fin t ↪ Fin e)
(hV : ∀ v, V v ∈ Matrix.unitaryGroup (Qubits d) ℂ)
(hW : ∀ v, W v ∈ Matrix.unitaryGroup (Qubits d) ℂ)
(hZ : ∀ v, Z v ∈ Matrix.unitaryGroup (Qubits e) ℂ) :
(∀ (x : EuclideanSpace ℂ I), IsState x → act O.support x = x → ∀ y : Qubits m,
probEvent (act (measurementMatrix O V) (tensorVec x (zeroKet d)))
(fun z => z.2 ∘ C = y) =
∑ v, subspaceProbability (pureDensity x) (O.proj v) * eigenspaceOutcomeProbability V C v y) ∧
measurementMatrix O V * measurementMatrix O W = measurementMatrix O (fun v => V v * W v) ∧
(∀ v, V v * W v ∈ Matrix.unitaryGroup (Qubits d) ℂ) ∧
firstMeasurement (K := Qubits e) O V * secondMeasurement (J := Qubits d) O Z =
secondMeasurement (J := Qubits d) O Z * firstMeasurement (K := Qubits e) O V ∧
(∀ (v : Fin r) (y : Qubits m) (z : Qubits t),
probEvent (act (V v ⊗ₖ Z v) (tensorVec (zeroKet d) (zeroKet e)))
(fun p => p.1 ∘ C = y ∧ p.2 ∘ D = z) =
eigenspaceOutcomeProbability V C v y * eigenspaceOutcomeProbability Z D v z) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, let , and put . Let be Hermitian idempotent complex matrices on with for , and put . Let and be unitary matrices on , let be unitary matrices on , and let and be injections. For any family of matrices on a finite index set , define , and write when acts on , with the corresponding definition using and for . Then all five assertions hold:
Here is the coordinate vector of the all-false string, , and has entries . The projector sum need not be the identity. Zero register lengths and are included; when , the first assertion has no norm-one vector satisfying , and assertions quantified over are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.