Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetric groups: a polynomial-size ideal QFT in Young orthogonal coordinates

Open
QAlgorithms.Papers.Independent.Intakenext100.P78.symmetric_qft

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For each n≥2n\ge2n≥2, use the point-stabilizer tower of SnS_nSn​ and its transversal products. Fix the Young orthogonal realization: the row and column labels are standard tableaux of the same shape λ\lambdaλ, and dλd_\lambdadλ​ is the number of such tableaux. The input encoding records the chosen transversal digits, and the output encoding records the two tableau paths. There are absolute C>0C>0C>0 and k∈Nk\in\mathbb Nk∈N such that, for every n≥2n\ge2n≥2, a single circuit of ideal one- and two-qubit unitaries, chosen before the amplitudes, has at most

C(1+⌈log⁡2(n!)⌉)kC\bigl(1+\lceil\log_2(n!)\rceil\bigr)^kC(1+⌈log2​(n!)⌉)k

gates and maps every normalized input ∑gf(g)∣g⟩\sum_g f(g)|g\rangle∑g​f(g)∣g⟩ to the clean encoded Fourier state with amplitudes

f^(λ)T,U=dλn!∑g∈Snf(g)ρλ(g)T,U.\widehat f(\lambda)_{T,U}=\sqrt{\frac{d_\lambda}{n!}}\sum_{g\in S_n}f(g)\rho_\lambda(g)_{T,U}.f​(λ)T,U​=n!dλ​​​g∈Sn​∑​f(g)ρλ​(g)T,U​.

Here normalized means ∑g∣f(g)∣2=1\sum_g|f(g)|^2=1∑g​∣f(g)∣2=1. Additional wires end in zero, and behavior on invalid binary codes is unconstrained. This gives the paper's polylogarithmic ideal gate bound in the named basis. It asserts neither a numerical synthesis algorithm nor a finite-alphabet approximation guarantee.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P78
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P78

open QAlgorithms

attribute [local instance] Classical.propDecidable

/-- PDF pp.5,8, unnumbered symmetric-group application: the normalized QFT
in the Young orthogonal basis has polylog(|S_n|) ideal elementary gate size.
The same circuit works for all normalized amplitudes; n=0,1 are absorbed
by the finite small-rank convention, and no synthesis/runtime/error claim
is added. The input is the explicit point-stabilizer transversal product. -/
theorem symmetric_qft :
    ∃ C : ℝ, 0 < C ∧ ∃ k : ℕ, ∀ n : ℕ, 2 ≤ n →
      ∃ q : ℕ, 4 * n * Nat.clog 2 (n + 1) ≤ q ∧
        ∃ c : Circuit oneTwoQubitGateSet q,
          (c.size : ℝ) ≤ C * ((1 + Nat.clog 2 n.factorial : ℕ) : ℝ) ^ k ∧
          realizesEncodedTransform c (symmetricInputCode n q) (symmetricOutputCode n q)
            symmetricFourier := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P78

end
Source
Generic Quantum Fourier Transforms, arXiv:quant-ph/0304064v1, PDF p. 8, Unnumbered application: symmetric groups
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

There exist a real constant C>0C>0C>0 and a natural number kkk, possibly 000, such that for every natural number n≥2n\ge2n≥2, there are a natural number q≥4nwq\ge4nwq≥4nw, where www is the least nonnegative integer satisfying n+1≤2wn+1\le2^wn+1≤2w, and a circuit ccc on qqq bits with

∣c∣≤C(1+⌈log⁡2(n!)⌉)k.|c|\le C\bigl(1+\lceil\log_2(n!)\rceil\bigr)^k.∣c∣≤C(1+⌈log2​(n!)⌉)k.

The circuit is a finite list of arbitrary complex unitary gates of arity one or two, each assigned injectively to circuit wires; ∣c∣|c|∣c∣ is its list length. A gate acts by its matrix on the assigned wires and leaves all other bits unchanged, and the circuit matrix VcV_cVc​ applies these embedded gates in list order. Its asserted action is the exact equality

Vc(∑xf(x) ∣In,q(x)⟩)=∑yFn(f)(y) ∣On,q(y)⟩for every f with ∑x∣f(x)∣2=1.V_c\left(\sum_x f(x)\,|I_{n,q}(x)\rangle\right) = \sum_{y}F_n(f)(y)\,|O_{n,q}(y)\rangle \qquad \text{for every }f\text{ with }\sum_x|f(x)|^2=1.Vc​(x∑​f(x)∣In,q​(x)⟩)=y∑​Fn​(f)(y)∣On,q​(y)⟩for every f with x∑​∣f(x)∣2=1.

Here ∣z⟩|z\rangle∣z⟩ is the coordinate vector supported at the bit string zzz; x=(xi)i<nx=(x_i)_{i<n}x=(xi​)i<n​ ranges over integer tuples with 0≤xi≤i0\le x_i\le i0≤xi​≤i; and In,q(x)I_{n,q}(x)In,q​(x) is the most-significant-bit-first qqq-bit encoding of ∑ixi2wi\sum_i x_i2^{wi}∑i​xi​2wi, reduced modulo 2q2^q2q. A frequency y=(λ,(U,T))y=(\lambda,(U,T))y=(λ,(U,T)) consists of a finite set λ⊆{0,…,n−1}2\lambda\subseteq\{0,\ldots,n-1\}^2λ⊆{0,…,n−1}2 and two injective sequences U,TU,TU,T of nnn boxes, each having downward-closed prefixes in the coordinatewise order and endpoint λ\lambdaλ. The output encoding On,q(y)O_{n,q}(y)On,q​(y) packs the list U0,1,U0,2,…,Un−1,1,Un−1,2,T0,1,T0,2,…,Tn−1,1,Tn−1,2U_{0,1},U_{0,2},\ldots,U_{n-1,1},U_{n-1,2},T_{0,1},T_{0,2},\ldots,T_{n-1,1},T_{n-1,2}U0,1​,U0,2​,…,Un−1,1​,Un−1,2​,T0,1​,T0,2​,…,Tn−1,1​,Tn−1,2​: a list d0,…,d4n−1d_0,\ldots,d_{4n-1}d0​,…,d4n−1​ represents ∑jdj2wj\sum_jd_j2^{wj}∑j​dj​2wj, again encoded modulo 2q2^q2q. Writing dλd_\lambdadλ​ for the number of paths with endpoint λ\lambdaλ, the output coefficient is

Fn(f)(λ,(U,T))=dλn!∑xf(x) Mxλ(U,T).F_n(f)(\lambda,(U,T)) =\sqrt{\frac{d_\lambda}{n!}}\sum_x f(x)\,M_x^\lambda(U,T).Fn​(f)(λ,(U,T))=n!dλ​​​x∑​f(x)Mxλ​(U,T).

To define MxλM_x^\lambdaMxλ​, visit levels ℓ=n−1,…,0\ell=n-1,\ldots,0ℓ=n−1,…,0, append xℓ,…,ℓ−1x_\ell,\ldots,\ell-1xℓ​,…,ℓ−1 in increasing order, and multiply the matrices AiλA_i^\lambdaAiλ​ in the resulting list order, with empty product the identity. For paths R,SR,SR,S, put i+=i+1i^+=i+1i+=i+1 if i+1<ni+1<ni+1<n, and i+=ii^+=ii+=i otherwise; set a=Sia=S_ia=Si​, b=Si+b=S_{i^+}b=Si+​, and r=(b2−b1)−(a2−a1)∈Rr=(b_2-b_1)-(a_2-a_1)\in\mathbb Rr=(b2​−b1​)−(a2​−a1​)∈R. If a1=b1a_1=b_1a1​=b1​, then Aiλ(R,S)=1{R=S}A_i^\lambda(R,S)=\mathbf1_{\{R=S\}}Aiλ​(R,S)=1{R=S}​; otherwise, if a2=b2a_2=b_2a2​=b2​, it equals −1{R=S}-\mathbf1_{\{R=S\}}−1{R=S}​; otherwise it equals r−1r^{-1}r−1 when R=SR=SR=S, 1−(r−1)2\sqrt{1-(r^{-1})^2}1−(r−1)2​ when R≠SR\ne SR=S and R=S∘(i i+)R=S\circ(i\ i^+)R=S∘(i i+), and 000 in all remaining cases. Real entries are embedded in C\mathbb CC, with inverse 0−1=00^{-1}=00−1=0 and real square root 000 on negative arguments. The constants C,kC,kC,k work for all n≥2n\ge2n≥2; no assertion is made for n<2n<2n<2, and no upper bound on qqq or algorithm for choosing the circuits is specified.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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