Left tensor framing of a uniformly implemented family
OpenGL2QFT.Circuits.uniformlyImplementsOn_framequantum-algorithmsquantum-circuitsrepresentation-theory
If is uniformly implemented on from to , and is an injective spectator register code whose bit width is polynomial-time computable from the binary encoding of , then is uniformly implemented on with concatenated codes and :
Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators open Classical open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT
namespace Circuits
theorem uniformlyImplementsOn_frame {P : FieldData → Prop} {A X Y : FieldData → Type} [∀ D, Fintype (A D)] [∀ D, Fintype (X D)] [∀ D, Fintype (Y D)] [∀ D, DecidableEq (A D)] {aW inW outW : FieldData → ℕ} (ca : ∀ D, A D → Qubits (aW D)) {cin : ∀ D, X D → Qubits (inW D)} {cout : ∀ D, Y D → Qubits (outW D)} {Φ : ∀ D, Matrix (Y D) (X D) ℂ} (h : UniformlyImplementsOn P cin cout Φ) (hca : ∀ D, P D → Function.Injective (ca D)) (haw : ∃ fw : Str → Str, PolyTimeComputable fw ∧ ∀ D, P D → fw D.encData = encNat (aW D)) : UniformlyImplementsOn P (fun D => appendCode (ca D) (cin D)) (fun D => appendCode (ca D) (cout D)) (fun D => frameMat (Φ D)) := by sorry
end Circuits
end GL2QFTSource
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §5 & §6.4.2–6.6 (pp. 28–47), tensor framing over spectator registers