Appendix H1–H2: asymptotic projective instrument
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.projective_measurement_limitFor an arbitrary finite nonempty normalized sample family, let project onto its span and let be the actual subnormalized branches of the Fig.7 instrument with ideal controlled reflections. For every input density operator,
Thus the limiting outcome probabilities and conditional states are those of the projective measurement. Subnormalized branches remain defined when a Born probability is zero; no normalization of an impossible conditioned event or new diamond-norm rate is asserted.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
noncomputable section
open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator
attribute [local instance] Classical.propDecidable
open MeasureTheory Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P67
variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
[Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
[Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]
/-- PDF pp.31–32: convergence to the two subnormalized projective branches, including
zero Born probability, with b=0 for span detection and b=1 for its complement. -/
theorem projective_measurement_limit [Nonempty K] (phi : K → EuclideanSpace ℂ I)
(hphi : ∀ k, IsState (phi k)) (rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) :
let Pi := samplePi (pureSamples phi)
Tendsto (fun T : ℕ => traceNorm (projectionBranch phi T false rho - Pi * rho * Pi)) atTop (nhds 0) ∧
Tendsto (fun T : ℕ => traceNorm (projectionBranch phi T true rho -
(1-Pi) * rho * (1-Pi))) atTop (nhds 0) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P67
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be finite index types with decidable equality, with nonempty, let each have norm , and let be positive semidefinite with trace . Define and , where , for , and the function is applied by continuous functional calculus. For each natural number , let , with ; for each history , let successively apply to the system controlled by ancilla , in increasing order of . Define , , and
Writing , with the square root given by continuous functional calculus, both limits hold:
The limits run through all natural , including the empty-history construction at ; the hypotheses cannot hold for empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.