One Fourier sample from a shared bounded-distance decoding pool
ProvedInfoLossLAR.WorstCase.RegevSearch.uniform_physical_fourier_rowlatticesprobabilityquantum-computing
A uniform bounded-distance decoder gives a uniform family for one Fourier readout. Fixing a lattice, widths, decoder precision and geometric cutoff fixes the normalized query amplitudes before the old pool is supplied. Each legal encoding of that pool yields a signed integer vector with probability one. Its discrepancy on a finite coefficient event is controlled by state preparation, the decoder failure on those amplitudes, and the finite Fourier grid.
Preamble
import Definitions.Def_InfoLossLAR_RegevSearch_UniformFourierRow set_option autoImplicit false open QAlgorithms.Complexity InfoLossLAR.WorstCase InfoLossLAR.WorstCase.RegevSketch open InfoLossLAR.WorstCase.RegevSearch.GaussianIteration open scoped BigOperators Classical
Formal statement
namespace InfoLossLAR.WorstCase.RegevSearch theorem uniform_physical_fourier_row (C : MFamily) (hC : IsMQPT C) (P : Polynomial ℕ) : UniformFourierRow C P := by sorry end InfoLossLAR.WorstCase.RegevSearch
Source
InfoLossLAR formalization of the single-coefficient Gaussian reduction, coherent shared-pool Fourier sampling, https://prove2.me/theorems/23174e03-6b1d-4113-b6b9-4dab17fa850a