The generator's phase table for is the intended one
ProvedOPI.Gen.zT_eqSetting. An instance of the two-fold OPI problem of Theorem 7.4 consists of a finite field (, , , bits per symbol), a length , a code, forbidden values and a precision . Let be the canonical additive character of , where is the trace. During the state preparation, the phase is applied by phase kickback into a -qubit phase-gradient register. The kickback is driven by the lookup table , which maps each -bit pattern encoding a pair to the -bit binary expansion of
The generator works only with natural numbers and lists. From the parsed input and an input length it forms , which contains , , , the coefficient list of and the budget . It builds the table with first-order field arithmetic, enumerating the patterns only when the budget allows it.
Statement. If , then for every
This is one of the equalities that identify the generated program with the intended one.
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
theorem OPI.Gen.zT_eq (b : ℕ) : zTab x.F b = zTabN (numsOf n (parsedOf x)).p (numsOf n (parsedOf x)).e
(numsOf n (parsedOf x)).w b (numsOf n (parsedOf x)).fl (numsOf n (parsedOf x)).Nb := by sorry