On the Fast Fourier Transform on SU(2)
This work provides a foundational algorithmic tool for efficient spectral analysis on SU(2), benefiting applications in quantum mechanics, theoretical physics, and spherical signal processing.
The paper presents a Fast Fourier Transform algorithm for the SU(2) group, achieving significant computational speedup over direct Fourier transform computation by exploiting recursive properties of Jacobi polynomials and a two-dimensional FFT on Euler angles.
The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing spectral analysis on this non-abelian compact Lie group. We present the Fourier Transform (FT) on SU(2) and develop a Fast Fourier Transform (FFT) algorithm inspired by the classical Cooley-Tukey divide-and-conquer scheme. Our approach efficiently discretizes the group using Euler angles, applying a two-dimensional FFT on the angular variables and exploiting the recursive properties of Jacobi polynomials. We provide an analysis of the computational complexity, demonstrating that our FFT-based method significantly outperforms the direct computation of the FT. This algorithm serves as a foundational tool for understanding the implementation of the FFT on SU(2), a key component in numerical simulations and advanced data analysis for high-performance computing applications on curved manifolds and quantum systems.