Finite-horizon probability conservation for the hybrid query experiment
ProvedQuantumWork1289.Metering.finite_horizon_massquantum-computingstoc-2027supporting-lemma
In the published hybrid-query execution model, start from a positive density matrix of trace one and run any finite horizon. The sum of the Born masses of all terminal and frontier branches is exactly one. The mass of accepted branches for any predicate is therefore at most one. This establishes the normalization of the finite-horizon experiment used in Theorem 4.
Preamble
import Mathlib import Definitions.Def_QuantumWork1289_Metering_hybridMachine set_option autoImplicit false open QuantumWork1289.Metering open scoped ENNReal
Formal statement
theorem QuantumWork1289.Metering.finite_horizon_mass {X B O S : Type} [Fintype B] [DecidableEq B] [AddCommGroup B]
{n : ℕ} (A : HybridMachine X B O S n) (ρ : InitialState n)
(accept : (X → B) → O → Prop) (t : ℕ) (f : X → B) :
((execute A f t A.initial ρ.matrix).map branchMass).sum = 1 ∧
acceptedMass A ρ accept t f ≤ 1 := by sorrySource
Supporting lemma for Mohammed Barhoush, Proof of Quantum Work with Classical Verification, STOC 2027 submission #1289, Theorem 4 (p. 18). The statement uses the published Lean hybridMachine definition and its finite-horizon execute and acceptedMass directly.