Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The generator's trial circuit is the gate list of the intended trial circuit

Proved
OPI.Gen.Cf_eq

by sragavan · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

lean-formalizationquantum-algorithmstwo-fold-opi-construction

Setting. An instance xxx of the two-fold OPI problem of Theorem 7.4 consists of a finite field F=Fp[X]/(f)F=\mathbb F_p[X]/(f)F=Fp​[X]/(f) (e=deg⁡fe=\deg fe=degf, q=peq=p^eq=pe, w=⌈log⁡2p⌉w=\lceil\log_2p\rceilw=⌈log2​p⌉, L=ewL=ewL=ew bits per symbol), a length mmm, a matrix HHH with a flag gen\mathrm{gen}gen defining a code CCC, forbidden values β∈Fm\beta\in F^mβ∈Fm and a precision ttt. Let D=C⊥D=C^\perpD=C⊥ with basis GGG and Schur products W=(Gj∗Gj′)W=(G_j\ast G_{j'})W=(Gj​∗Gj′​). Put B=t+mL+m+2L+12B=t+mL+m+2L+12B=t+mL+m+2L+12.

Each trial of the Regev-style reduction runs a reversible trial circuit on the concrete wire layout (precision 2B2B2B, gradient register of 2B2B2B qubits). The circuit consists of three parts:

  1. the decoder circuit, which uses QFTq\mathrm{QFT}_qQFTq​ gadgets, the tables of Pβ:y↦βi−yP_\beta:y\mapsto\beta_i-yPβ​:y↦βi​−y and the compiled Schur-square relinearization decoder for DDD (built from GGG and WWW);
  2. a subtraction circuit, which removes the decoded word from the data registers;
  3. the inverse of the decoder circuit.

A Clifford+T gate is recorded by its list of fields: a kind code (000 for HHH, 111 for TTT, 222 otherwise) followed by its wire indices. The function gfields\mathrm{gfields}gfields maps a gate to this list.

The generator works only with natural numbers and lists. From the parsed input and an input length nnn it forms u=numsOf(n,parsedOf(x))u=\mathrm{numsOf}(n,\mathrm{parsedOf}(x))u=numsOf(n,parsedOf(x)) and builds the list CfN(u)\mathrm{CfN}(u)CfN(u) of gate fields. It assembles this list from its own layout tuple, its own basis and Schur products, and first-order lookup tables enumerated up to the budget Nb=8q~ 8N_b=8\tilde q^{\,8}Nb​=8q~​8.

Statement. If pe≤np^e\le npe≤n, then

map gfields (trialCirc(x))=CfN(numsOf(n,parsedOf(x))),\mathrm{map}\ \mathrm{gfields}\ \big(\mathrm{trialCirc}(x)\big)=\mathrm{CfN}\big(\mathrm{numsOf}(n,\mathrm{parsedOf}(x))\big),map gfields (trialCirc(x))=CfN(numsOf(n,parsedOf(x))),

where trialCirc(x)\mathrm{trialCirc}(x)trialCirc(x) is the trial circuit with the parameters above.

This is the largest of the equalities that identify the generated program with the intended one. It covers the whole quantum decoding step of a trial.

Preamble
import Definitions.Def_TwoFoldOPI_CL_Part05
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Circuit
import Definitions.Def_QAlgorithms_Defs_GradientMethods
import Definitions.Def_QAlgorithms_Defs_OPIOraclePrograms
import Definitions.Def_QAlgorithms_Defs_OPIUniformity
import Definitions.Def_QAlgorithms_Defs_Fourier
import Definitions.Def_TwoFoldOPI_elemBits
import Definitions.Def_TwoFoldOPI_schurSquare
import Definitions.Def_TwoFoldOPI_schurFailureSum
import Definitions.Def_CodingTheory
import Definitions.Def_OAIThreeMachineSched01
import Definitions.Def_CookLevin_Cost
import Definitions.Def_TwoFoldOPI_codeOf
import Definitions.Def_TwoFoldOPI_solves
import Definitions.Def_TwoFoldOPI_Input
import Definitions.Def_TwoFoldOPI_CLSerializableF
open OPI OPI.Gen
open QAlgorithms QAlgorithms.OPI TwoFoldOPI Lay TD RRefC FM SymEnc
local notation "vl" => List.map Fin.val
variable (x : Input) (n : ℕ) (hq : x.F.p ^ x.F.f.natDegree ≤ n)
include hq
local notation "u" => numsOf n (parsedOf x)
local notation "KD" => kdOf x.F x.m x.gen x.H
set_option maxHeartbeats 1000000
Formal statement
theorem OPI.Gen.Cf_eq :
    (trialCirc x.F x.m (2 * Bpar x.t x.m (bitsPerSymbol x.F)) (2 * Bpar x.t x.m (bitsPerSymbol x.F) - 1) x.gen x.H
      (tB_pos x.F x.m x.t) (tB_le x.F x.m x.t) x.β).map gfields = CfN (numsOf n (parsedOf x)) := by sorry
Source
Formalization of Theorem 7.4 (algorithmic part), repository https://github.com/sragavan99/lean-prove2me-fills/blob/f7224a159e790347c1a83c5ac23c63e5094a6a2c/WorkInProgress/QuantumOPIVariants/OPI/IRGenQuant.lean#L120-L143

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