Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.12: an efficient quantum Fourier transform for Bn(d)B_n(d)Bn​(d), Br,s(d)B_{r,s}(d)Br,s​(d) and Pn(d)P_n(d)Pn​(d)

Open
SemisimpleQFT.theorem_6_12

by Shuze Chen · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory

Let A∈{Bn(d),Br,s(d),Pn(d)}A\in\{B_n(d),B_{r,s}(d),P_n(d)\}A∈{Bn​(d),Br,s​(d),Pn​(d)} (with n=r+sn=r+sn=r+s for the walled Brauer algebra). The Fourier transform FTA\mathrm{FT}_AFTA​ can be implemented on a quantum computer up to operator norm error

O(poly(∣A∣)⋅d−1/2+ε)O\big(\mathrm{poly}(|A|)\cdot d^{-1/2}+\varepsilon\big)O(poly(∣A∣)⋅d−1/2+ε)

by quantum circuits with gate complexity

O~(n15/2⋅(n+log⁡d+log⁡(1/ε)))  for Bn(d) and Br,s(d),O~(n15/2⋅(n+log⁡d+log⁡(1/ε)))  for Pn(d).\widetilde O\big(n^{15/2}\cdot(\sqrt n+\log d+\log(1/\varepsilon))\big)\ \text{ for }B_n(d)\text{ and }B_{r,s}(d),\qquad \widetilde O\big(n^{15/2}\cdot(n+\log d+\log(1/\varepsilon))\big)\ \text{ for }P_n(d).O(n15/2⋅(n​+logd+log(1/ε)))  for Bn​(d) and Br,s​(d),O(n15/2⋅(n+logd+log(1/ε)))  for Pn​(d).

The Fourier transform is performed with respect to the subalgebra adapted bases from Section 5.3 and the orthogonal form in Section 5.4.

Precise form. There are absolute constants CCC and kkk such that for every nnn (resp. r≤sr\le sr≤s), every ddd in the semisimple range (d∉{0,…,n}d\notin\{0,\dots,n\}d∈/{0,…,n} for Bn(d)B_n(d)Bn​(d), d∉{0,…,r+s−2}d\notin\{0,\dots,r+s-2\}d∈/{0,…,r+s−2} for Br,s(d)B_{r,s}(d)Br,s​(d), d∉{0,…,2n−2}d\notin\{0,\dots,2n-2\}d∈/{0,…,2n−2} for Pn(d)P_n(d)Pn​(d)) and every 0<ε≤10<\varepsilon\le10<ε≤1, there exist a subalgebra adapted system of Fourier bases for the chain of Section 5.3 that is in the orthogonal form and labelled as in Theorem 4.17, and a circuit of one- and two-qubit unitary gates with at most C f log⁡(2+f)kC\,f\,\log(2+f)^kCflog(2+f)k gates, fff being the expression inside O~\widetilde OO, such that

∥U Jin−Jout FTA∥∞≤C(∣A∣k d−1/2+ε).\big\|U\,J_{\mathrm{in}}-J_{\mathrm{out}}\,\mathrm{FT}_A\big\|_\infty\le C\big(|A|^k\,d^{-1/2}+\varepsilon\big).​UJin​−Jout​FTA​​∞​≤C(∣A∣kd−1/2+ε).

Here FTA\mathrm{FT}_AFTA​ is the normalized Fourier transform of Definition 3.1 from the scaled diagram basis B(A)\mathcal B(A)B(A) (Eq. (4.10)) to the states ∣ρ,P,Q⟩|\rho,P,Q\rangle∣ρ,P,Q⟩; JinJ_{\mathrm{in}}Jin​ stores a basis element by the bit string of its diagram and JoutJ_{\mathrm{out}}Jout​ stores ∣ρ,P,Q⟩|\rho,P,Q\rangle∣ρ,P,Q⟩ by the bit strings of the Bratteli paths PPP and QQQ, all remaining qubits being ∣0⟩|0\rangle∣0⟩ before and after.

Preamble
import Definitions.Def_SemisimpleQFT_Circuit

open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT

theorem theorem_6_12 :
    ∃ (C : ℝ) (k : ℕ),
      (∀ (n d : ℕ) (ε : ℝ), n < d → 0 < ε → ε ≤ 1 →
        HasEfficientQFT n (brauerLevel n) d (brauerBratteli n) Shape.size shapeBits
          (softO C k ((n : ℝ) ^ ((15 : ℝ) / 2) *
            (Real.sqrt (n : ℝ) + Real.log (d : ℝ) + Real.log (1 / ε))))
          (C * ((Nat.card (brauerLevel n n) : ℝ) ^ k / Real.sqrt (d : ℝ) + ε))) ∧
      (∀ (r s d : ℕ) (ε : ℝ), r ≤ s → r + s < d + 2 → 0 < ε → ε ≤ 1 →
        HasEfficientQFT (r + s) (walledLevel r (r + s)) d (walledBratteli r (r + s))
          pairSize pairBits
          (softO C k (((r + s : ℕ) : ℝ) ^ ((15 : ℝ) / 2) *
            (Real.sqrt ((r + s : ℕ) : ℝ) + Real.log (d : ℝ) + Real.log (1 / ε))))
          (C * ((Nat.card (walledLevel r (r + s) (r + s)) : ℝ) ^ k / Real.sqrt (d : ℝ) + ε))) ∧
      (∀ (n d : ℕ) (ε : ℝ), 2 * n < d + 2 → 0 < ε → ε ≤ 1 →
        HasEfficientQFT (2 * n) (partitionLevel n) d (partitionBratteli n) Shape.size shapeBits
          (softO C k ((n : ℝ) ^ ((15 : ℝ) / 2) *
            ((n : ℝ) + Real.log (d : ℝ) + Real.log (1 / ε))))
          (C * ((Nat.card (partitionLevel n (2 * n)) : ℝ) ^ k / Real.sqrt (d : ℝ) + ε))) := by sorry

end SemisimpleQFT
Source
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, p. 52, Theorem 6.12, Eqs. (6.82)–(6.84)
Human review
  • Endorsed by Community (Bot) · Nov 19, 2026

  • Endorsed by Shuze Chen · Nov 19, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me