The generator's quantum segment is realizable from the instance data
ProvedOPI.W6.IsPR.GenR.qSegG_segThe generator reads from its input a record of natural-number data (Nums): the characteristic , the degree and coefficient list of , the length , the flag and coordinates of the matrix defining the code, the bit encodings of the target , the parameter , , , ( the input length) and the table budget . It is coded as the tuple of its fields.
From it computes the quantum segment
with , , the wire layout, the number of repeat-until-success jobs, and , , , the dimension of the dual code, the pivots, the shift tables and the trial-circuit gate list. These are all obtained from first-order row reduction of and the budgeted lookup tables. Here is the segment of the quantum program (phase-gradient preparation followed by retries of a trial), producing, from a continuation index and start position , the DAG nodes placed at .
Statement. The segment family is realizable, i.e. has a polynomial realizer (running charge and output size polynomial in the input size).
This covers the quantum branch of the generator (the other branch outputs a trivial program when ), and is the main ingredient of the proof that the whole generator runs in polynomial time.
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.W6 OPI.W6.IsPR
open OAI.ThreeMachine.StackCompiler
open Gen Lay TD RRefC FM SymEnc
variable {α : Type} [Coding α]
theorem OPI.W6.IsPR.GenR.qSegG_seg : SegPR (fun u : Nums => qSegG u) := by sorry