One coordinate of the real decoder is within of the ideal one
ProvedOPI.SymEnc.step_closeLet be a presented field () and fix a real decoder layout: for each coordinate of , the gadgets ( on ) and (antisymmetrization of ), and two gadgets acting on and . Each gadget is catalysed by a -qubit gradient register, uses phase estimation with bits, and consumes resource states prepared on dedicated resource registers. For a list of resources, denotes with those resource states attached. Let be the resources of coordinate , and the error bound of one gadget.
The real operator of coordinate is . The ideal operator replaces the two gadgets by the exact Fourier transform over on and .
Statement. Let be a list of coordinates not containing , a symbol-level amplitude, and assume for some symbol-level . Then
So the real coordinate step uses up the resources of coordinate , leaves the others untouched, and is close to the ideal step. Summing over coordinates gives real_close, the bound for the whole real decoder.
import Definitions.Def_TwoFoldOPI_CL_Part02
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.SymEnc
open QAlgorithms TwoFoldOPI Matrix
variable (F : AvgCaseTI.FieldPres) {n b t m : ℕ}
variable {F}
variable {reg : Fin m × Bool × Fin (bitsPerSymbol F) ↪ Fin n} (D : RealDec F reg b t)
variable {D}
theorem OPI.SymEnc.step_close (hp : 0 < F.p) (ht : 1 ≤ t) (i : Fin m) (β : F.F) (os : List (Fin m)) (hos : i ∉ os)
(Fn F1 : (Fin m → F.F × F.F) → ℂ)
(hY1 : (Circuit.unitary (eGad (reg := reg) i (D.W i).ZE (D.W i).asE (D.W i).aE (D.W i).fE)).mulVec
((Circuit.unitary (revCirc (pGad reg (elemBits F) i (D.W i).ZP (D.W i).asP (D.W i).fP
(fun x => β - x)))).mulVec (J reg (elemBits F) Fn)) = J reg (elemBits F) F1) :
vnorm ((actC D i β).mulVec (bfacL (resC D i ++ os.flatMap (resC D)) (J reg (elemBits F) Fn)) -
bfacL (os.flatMap (resC D)) ((cOp (D.W i) β).mulVec (J reg (elemBits F) Fn))) ≤
epsQ F b t * (2 + epsQ F b t) * vnorm (J reg (elemBits F) Fn) := by sorry