Theorem 3.4:
OpenSemisimpleQFT.theorem_3_4diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory
There is an absolute constant such that the following holds. Let be a semisimple algebra with a chosen Fourier isomorphism and computational basis , and let
If is -nice with (the standing assumption of Section 3.1), then
where and is the operator norm.
Preamble
import Definitions.Def_SemisimpleQFT_Fourier open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT
theorem theorem_3_4 :
∃ C : ℝ, ∀ (A : Type) [Ring A] [Algebra ℂ A] (Λ J ι : Type)
[Fintype J] [DecidableEq J] [Fintype ι] [DecidableEq ι]
(F : FourierData A Λ J) (b : Module.Basis ι ℂ A) (δ : ℝ),
δ ≤ 1 / 2 → F.IsNice (CompBasis.ofBasis b) δ →
QAlgorithms.specNorm (F.FT (CompBasis.ofBasis b) - F.FTtilde (CompBasis.ofBasis b)) ≤
C * δ * (Fintype.card ι : ℝ) ^ ((3 : ℝ) / 2) := by sorry
end SemisimpleQFTSource
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, p. 20, Theorem 3.4, Eq. (3.19)
Human review
Confirmed by the mission captain (proposal self-audit).