Congruence of `UniformlyImplementsOn` under matrix equality on the predicate domain
OpenGL2QFT.Circuits.uniformlyImplementsOn_eqquantum-algorithmsquantum-circuitsrepresentation-theory
Let be a predicate on finite-field instances , and let be families of linear operators that agree pointwise whenever holds:
If a uniform family of Clifford+ quantum circuits implements on with input code and output code , then the same circuit family uniformly implements on .
This congruence rule allows algebraic matrix factorizations proved over to be substituted directly into uniform circuit bounds.
Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators open Classical open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT
namespace Circuits
theorem uniformlyImplementsOn_eq {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) ℂ} (h : UniformlyImplementsOn P cin cout Φ) (heq : ∀ D, P D → Φ D = Φ' D) : UniformlyImplementsOn P cin cout Φ' := by sorry
end Circuits
end GL2QFTSource
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §2.2 & §6.4 (pp. 12, 41), uniformity invariance under target equality