Joint quantum output error under reuse of one sample pool
ProvedInfoLossLAR.WorstCase.RegevSketch.joint_coherent_pool_boundLet be a finite probability space and let a normalized quantum state evolve through isometries. For each stored sample , suppose the actual sequence of isometries may depend on that same sample at every step; the ideal sequence is independent of . Let be the ideal state after the first steps. Assume the average squared norm of the step error at is at most . For every event on the complete measured register, the averaged absolute difference in its Born probability between the actual and ideal final states is bounded by
The event may couple all output and garbage registers, and the same sample may be reused across steps. This abstract estimate is a reusable error bound for coherent DGS reductions; it does not assert that an actual DGS circuit satisfies the hypotheses.
Formalization Note. The state space is finite-dimensional complex Euclidean space; the hypotheses impose the squared norm bound on each ideal prefix rather than on the actual sample-dependent query state.
import Definitions.Def_RegevJointHybrid set_option autoImplicit false open scoped BigOperators open RegevJointHybrid
namespace InfoLossLAR.WorstCase.RegevSketch
theorem joint_coherent_pool_bound {Ω α : Type*} [Fintype Ω] [Fintype α]
(pool : Ω → ℝ) (hpool : ∀ sample,0 ≤ pool sample)
(hmass : ∑ sample,pool sample=1)
(actual : Ω → ℕ → EuclideanSpace ℂ α →ₗᵢ[ℂ] EuclideanSpace ℂ α)
(ideal : ℕ → EuclideanSpace ℂ α →ₗᵢ[ℂ] EuclideanSpace ℂ α)
(count : ℕ) (state : EuclideanSpace ℂ α) (hstate : ‖state‖=1)
(event : α → Prop) (failure : ℕ → ℝ)
(hstep : ∀ index<count,
(∑ sample,pool sample*
‖actual sample index (evolve ideal index state)-ideal index (evolve ideal index state)‖^2) ≤
2*failure index) :
(∑ sample,pool sample*|bornEvent event (evolve (actual sample) count state)-
bornEvent event (evolve ideal count state)|) ≤
∑ index ∈ Finset.range count,4*Real.sqrt (failure index) := by sorry
end InfoLossLAR.WorstCase.RegevSketch