The generator's layout parameters are those of the intended program
ProvedOPI.Gen.XN_eqSetting. An instance of the two-fold OPI problem of Theorem 7.4 consists of a finite field (, ), a length , a matrix over with a flag defining a code , forbidden values and a precision . Let and . A symbol occupies qubits, where . The quantum program uses
and runs its gadgets with precision , using a phase-gradient register of qubits. All wires are laid out by a parameter record , where is the register count of the compiled relinearization decoder. turns this record into a plain tuple of natural numbers.
The generator works only with natural numbers and lists. From the parsed input and an input length it forms and the layout tuple
where and are computed from .
Statement. If , then
Since every wire index in the generated DAG is computed from this tuple, the lemma is the basic step in showing that the generated gate lists coincide with those of the intended program.
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.XN_eq : XN (numsOf n (parsedOf x)) =
toN (parOf x.F x.m (2 * Bpar x.t x.m (bitsPerSymbol x.F)) (2 * Bpar x.t x.m (bitsPerSymbol x.F) - 1 + 1)
(nIds x.m KD (KD * KD))) := by sorry