The generator's trial circuit is the gate list of the intended trial circuit
ProvedOPI.Gen.Cf_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 Schur products . Put .
Each trial of the Regev-style reduction runs a reversible trial circuit on the concrete wire layout (precision , gradient register of qubits). The circuit consists of three parts:
- the decoder circuit, which uses gadgets, the tables of and the compiled Schur-square relinearization decoder for (built from and );
- a subtraction circuit, which removes the decoded word from the data registers;
- the inverse of the decoder circuit.
A Clifford+T gate is recorded by its list of fields: a kind code ( for , for , otherwise) followed by its wire indices. The function maps a gate to this list.
The generator works only with natural numbers and lists. From the parsed input and an input length it forms and builds the list 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 .
Statement. If , then
where 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.
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
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