The generator's shift tables of the linear map are the intended ones
ProvedOPI.Gen.TG_eqSetting. An instance of the two-fold OPI problem of Theorem 7.4 consists of a finite field (, , , bits per symbol), a length , a matrix with a flag defining a code , forbidden values and a precision . Let with basis and pivots . The state preparation turns a word supported on the pivot columns with values into the codeword . It does this with reversible table gadgets: for each pair it adds times the symbol in register to the symbol in register .
For , the shift table of is the lookup table of the map on pairs of -bit symbol encodings, where is left unchanged if it does not encode a field element. The table matrix has as entry the pair (shift table of , shift table of ), the second one serving as the inverse.
The generator works only with natural numbers and lists. From the parsed input and an input length it forms and builds . This is the same matrix, but indexed by , , with entries read from its own basis coordinates and tables computed by first-order field arithmetic up to the budget .
Statement. If , then
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.TG_eq : TGW (basisOf x.gen x.H).G (bitsPerSymbol x.F) = TGN (numsOf n (parsedOf x)) := by sorry