Classical case split of `UniformlyImplementsOn` at vs.
OpenGL2QFT.Circuits.uniformlyImplementsOn_by_q2quantum-algorithmsquantum-circuitsrepresentation-theory
If an operator family admits a uniform Clifford+ implementation when and another uniform implementation when , then is uniformly implemented on all instances satisfying .
Formalization Note The condition is equivalent to , which is decided in polynomial time from the self-delimiting binary encoding of .
Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators open Classical open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT
namespace Circuits
theorem uniformlyImplementsOn_by_q2 {P : FieldData → Prop} {X Y : FieldData → Type} [∀ D, Fintype (X D)] [∀ D, Fintype (Y D)] {inW outW : FieldData → ℕ} {cin : ∀ D, X D → Qubits (inW D)} {cout : ∀ D, Y D → Qubits (outW D)} {Φ : ∀ D, Matrix (Y D) (X D) ℂ} (h2 : UniformlyImplementsOn (fun D => P D ∧ D.q = 2) cin cout Φ) (hgt2 : UniformlyImplementsOn (fun D => P D ∧ 2 < D.q) cin cout Φ) : UniformlyImplementsOn P cin cout Φ := by sorry
end Circuits
end GL2QFTSource
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §6.5, Remark 6.15 (p. 48) & Theorem 6.14 (p. 47), splitting from