A one-register qubit operator acts on symbol-level states as a kernel on one component
ProvedOPI.SymEnc.embedOp_JLet be a finite set of symbols with an injective encoding . There are coordinates; coordinate holds a pair in two registers of qubits each, indexed by a component bit (component is , component is ). Every other qubit is . A tuple thus determines a basis configuration , and a symbol-level state is embedded as .
Let be an -qubit matrix that maps encodings into the span of encodings: whenever is not an encoding. Fix a coordinate and a component , and let be acting on that register.
Statement.
In the Lean statement is written as the kernel operator , where if and have the same other component, and otherwise.
This lets the analysis of the decoder work entirely at the level of field symbols: each gate that acts on one symbol register (re-encodings, , the maps ) becomes an explicit kernel on that coordinate.
import Definitions.Def_TwoFoldOPI_CL_Part01
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
variable {n m L : ℕ} {K : Type} [Fintype K] [DecidableEq K]
(reg : Fin m × Bool × Fin L ↪ Fin n) (enc : K → Qubits L)
variable {reg enc}
variable (reg enc)
variable {reg enc}
open Classical
theorem OPI.SymEnc.embedOp_J (henc : Function.Injective enc) (M : Matrix (Qubits L) (Qubits L) ℂ)
(hM : ∀ y x, y ∉ Set.range enc → M y (enc x) = 0) (i : Fin m) (c : Bool)
(Fn : (Fin m → K × K) → ℂ) :
(embedOp M (bReg reg i c)).mulVec (J reg enc Fn) =
J reg enc (opK i (fun w z => if z = setComp c w (comp c z) then
M (enc (comp c w)) (enc (comp c z)) else 0) Fn) := by sorry