Coherent finite-gate preparation of truncated Gaussian tickets with retries
ProvedInfoLossLAR.WorstCase.RegevSearch.coherent_gaussian_ticket_preparationFix a polynomial-time generator of finite-precision requests for a one-dimensional Gaussian. Two positive synthesis and interpretation constants suffice for every request word. Let be its standard width parameter, whose square is the prescribed variance, and let denote the request's truncation factor. Give the binary ticket register enough capacity for the truncated integer interval and the header enough space for the request. For any positive retry count , the finite gate circuit begins in the prescribed classical basis state and produces a unit vector . There is a unit spectator state for which
Here is the normalized truncated Gaussian ticket state, embeds the selected ticket and the retained registers into the full qubit space, and is the single-trial error given by the numerical and gate-synthesis budgets. This provides a coherent Gaussian source with a uniform choice of synthesis constants as the ticket width and accuracy vary.
import Definitions.Def_InfoLossLAR_CoherentGaussianTickets set_option autoImplicit false open QAlgorithms.Complexity OAI.MetricKMedian.Binary.Automatic open InfoLossLAR.WorstCase.GaussianRandomizedRounding.Wide open InfoLossLAR.WorstCase.GaussianRandomizedRounding.Wide.Coherent.Padding
theorem InfoLossLAR.WorstCase.RegevSearch.coherent_gaussian_ticket_preparation
(request : Str → PointRequest × List Unit) (hr : Poly request)
(hp : ∀ a : ℕ, Poly (Builder.gateWord request a)) :
RegisteredTrial.contract request hp := by sorry