Theorem 2.11: the Fourier basis in terms of the dual basis
OpenSemisimpleQFT.theorem_2_11diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory
Let be a semisimple algebra with a chosen Fourier isomorphism and Fourier basis , and let be any basis of . Then a dual family of with respect to the left regular trace form exists (i.e. ), and for every such dual family and all ,
Preamble
import Definitions.Def_SemisimpleQFT_Fourier open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT
theorem theorem_2_11 {A : Type*} [Ring A] [Algebra ℂ A] {Λ J ι : Type*}
[Fintype J] [DecidableEq J] [Fintype ι] [DecidableEq ι]
(F : FourierData A Λ J) (b : Module.Basis ι ℂ A) :
(∃ bs : ι → A, IsRegDual b bs) ∧
∀ bs : ι → A, IsRegDual b bs → ∀ i j : J, F.lab i = F.lab j →
F.E i j = (F.dim (F.lab i) : ℂ) • ∑ a : ι, F.rep (bs a) j i • b a := by sorry
end SemisimpleQFTSource
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, p. 16, Theorem 2.11, Eq. (2.7)
Human review
Confirmed by the mission captain (proposal self-audit).