Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compile polynomial-time string functions to uniform quantum circuits

Proved
InfoLossLAR.WorstCase.RegevSketch.polytime_string_to_mqpt

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

lar-regev-bridgelatticeslearning-with-errorsquantum-computing

Let f:{0,1}∗→{0,1}∗f:\{0,1\}^*\to\{0,1\}^*f:{0,1}∗→{0,1}∗ be a deterministic polynomial-time string function. There is a uniform quantum polynomial-time multi-output circuit family PPP such that, for any input www and any event FFF on finite binary strings closed under appending a suffix,

f(w)∈F⟹Pr⁡[P(w)∈F]=1.f(w)\in F\quad\Longrightarrow\quad\Pr[P(w)\in F]=1.f(w)∈F⟹Pr[P(w)∈F]=1.

The family has one output length per input length, so its output may contain a suffix after f(w)f(w)f(w). This general compilation interface allows deterministic classical algorithms to be used as subroutines in prefix-decoded quantum output problems.

Formalization Note. Polynomial time is the platform's multi-stack Turing-machine predicate; the resulting family is uniform in its fixed Clifford+T gate set. The formal inequality is 1≤Pr⁡[P(w)∈F]1\le\Pr[P(w)\in F]1≤Pr[P(w)∈F], which is probability one when circuit well-formedness is used.

Preamble
import Definitions.Def_InfoLossLAR_RegevSketch_DGS

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

theorem polytime_string_to_mqpt (f : Str → Str) (hf : PolyTimeComputable f) :
  ∃ P : MFamily, IsMQPT P ∧ ∀ w : Str, ∀ event : Str → Prop,
    (∀ s t, event s → s <+: t → event t) → event (f w) →
      (1 : ℝ) ≤ outputProb P w 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; generic multi-output classical-to-quantum model and encoding closure needed to formalize the finite-dimensional patch, not a verbatim theorem from that source.

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