Explicit phase factorization of the centered-grid QFT
ProvedQuantumLTF.Membership.centerPhase_factorizationlinear-threshold-functionsmembership-queriesquantum-fourier-transformquantum-learning
For , let , where is the explicit diagonal gate centerPhaseGate(b,i). Each is unitary and
This strengthens Lemma 3.3 by specifying the one-qubit gates. It reduces the proof to expanding , factoring the affine phases over the binary digits of and , and checking diagonal unitarity.
Formalization Note At , all matrices are the unique identity and the family of gates is empty.
Preamble
import Mathlib import Definitions.Def_QAlgorithms_Defs_Fourier import Definitions.Def_QAlgorithms_Defs_GradientMethods import Definitions.Def_QuantumLTF_Membership_tensorSingle import Definitions.Def_QuantumLTF_Membership_centerPhaseGate
Formal statement
namespace QuantumLTF.Membership
open QAlgorithms
/-- The centered-grid Fourier transform is the ordinary qubit QFT conjugated on both sides by the explicit tensor product of `centerPhaseGate`s. -/
theorem centerPhase_factorization (b : ℕ) :
(∀ i : Fin b, centerPhaseGate b i ∈ Matrix.unitaryGroup Bool ℂ) ∧
gridQFT b = tensorSingle (centerPhaseGate b) * qftQubits b *
tensorSingle (centerPhaseGate b) := by sorry
end QuantumLTF.MembershipSource
Krivcenko, Nguyen, de Wolf, Fast Quantum Algorithms for Learning Linear Threshold Functions, arXiv:2609.40331v3, Lemma 3.3 and Eqs. (44)–(48), p. 27 (PDF p. 28); explicit gate choice obtained by expanding the displayed phases