Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform quantum dispatch by encoded lattice dimension

Proved
InfoLossLAR.WorstCase.RegevSketch.sivp_dimension_dispatch

by BoomShaKaLaaaKa · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

lar-regev-bridgelatticeslearning-with-errorsquantum-computing

Let AAA and EEE be uniform multi-output quantum polynomial-time circuit families, and fix a dimension cutoff N0N_0N0​. There exists a uniform multi-output quantum polynomial-time family PPP with the following property. For every nnn, integer n×nn\times nn×n matrix BBB, and event FFF on binary output strings that remains true under appending any suffix,

Pr⁡[P(enc⁡(B))∈F]≥{Pr⁡[E(enc⁡(B))∈F],n<N0,Pr⁡[A(enc⁡(B))∈F],n≥N0.\Pr[P(\operatorname{enc}(B))\in F]\ge \begin{cases} \Pr[E(\operatorname{enc}(B))\in F], & n<N_0,\\ \Pr[A(\operatorname{enc}(B))\in F], & n\ge N_0. \end{cases}Pr[P(enc(B))∈F]≥{Pr[E(enc(B))∈F],Pr[A(enc(B))∈F],​n<N0​,n≥N0​.​

The guarantee applies to all integer matrices, including singular ones, and to all prefix-monotone events. It isolates the input-dimension dispatch and circuit-composition obligation for multi-output solvers; output strings from different branches may have different lengths.

Formalization Note. The input is the self-delimiting platform matrix encoding; uniformity and the Born-rule probabilities use the existing MFamily\mathrm{MFamily}MFamily interface.

Preamble
import Definitions.Def_InfoLossLAR_RegevSketch_DGS

set_option autoImplicit false
open QAlgorithms.Complexity
open InfoLossLAR.WorstCase
Formal statement
namespace InfoLossLAR.WorstCase.RegevSketch

theorem sivp_dimension_dispatch (A E : MFamily) (hA : IsMQPT A) (hE : IsMQPT E)
    (cutoff : ℕ) : ∃ P : MFamily, IsMQPT P ∧
      ∀ n, ∀ B : Matrix (Fin n) (Fin n) ℤ, ∀ event : Str → Prop,
        (∀ s t, event s → s <+: t → event t) →
        (if n < cutoff then outputProb E (encMat encI B) event
          else outputProb A (encMat encI B) event) ≤
            outputProb P (encMat encI B) event
 := by sorry

end InfoLossLAR.WorstCase.RegevSketch
Source
Chen Qian, Information Loss Is All You Need: TC⁰ Pseudorandomness from Worst-Case Lattices, arXiv:2611.05136, Appendix I.1, pp. 132–133. Explicit circuit-composition and encoding closure obligation for the finite-dimension patch, not a theorem claimed verbatim in the paper.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me