Sequential composition of `UniformlyImplementsOn` families
OpenGL2QFT.Circuits.uniformlyImplementsOn_seqquantum-algorithmsquantum-circuitsrepresentation-theory
Let and be uniformly implemented by Clifford+ circuit families on matching at an intermediate code of width . Suppose is contractive whenever holds:
Then the composed linear map is uniformly implemented on from to .
Formalization Note Running precision on both subcircuits limits the propagated error to , with total wire count .
Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators open Classical open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT
namespace Circuits
theorem uniformlyImplementsOn_seq {P : FieldData → Prop} {X M Y : FieldData → Type} [∀ D, Fintype (X D)] [∀ D, Fintype (M D)] [∀ D, Fintype (Y D)] {inW midW outW : FieldData → ℕ} {cin : ∀ D, X D → Qubits (inW D)} {cmid : ∀ D, M D → Qubits (midW D)} {cout : ∀ D, Y D → Qubits (outW D)} {Φ1 : ∀ D, Matrix (M D) (X D) ℂ} {Φ2 : ∀ D, Matrix (Y D) (M D) ℂ} (h1 : UniformlyImplementsOn P cin cmid Φ1) (h2 : UniformlyImplementsOn P cmid cout Φ2) (hbnd : ∀ D, P D → ∀ ψ : EuclideanSpace ℂ (X D), ‖WithLp.toLp 2 ((Φ1 D).mulVec (WithLp.ofLp ψ))‖ ≤ ‖ψ‖) : UniformlyImplementsOn P cin cout (fun D => Φ2 D * Φ1 D) := by sorry
end Circuits
end GL2QFTSource
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §6.4 (pp. 41–47) & §2.2, subadditivity of operator-norm errors under sequential composition