On the Fast Fourier Transform on SU(2)

• URL: http://arxiv.org/abs/2605.23923v1
• Date: Sun, 19 Apr 2026 17:38:38 GMT
• Title: On the Fast Fourier Transform on SU(2)
• Abstract summary: Special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics.<n>We develop a Fast Fourier Transform algorithm inspired by the classical Cooley-Tukey divide-and-dimensional scheme.
• Score: 45.899400495223375
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations [2.1496959255800188]
  We present a unified algorithmic framework for quantum simulation of non-unitary dynamics and matrix functions.<n>By reinterpreting discretization errors as spectral folding in dual domains, we synthesize two distinct algorithmic paths.<n>We demonstrate the versatility of this framework by efficiently simulating diverse phenomena.
  arXiv  Detail & Related papers  (2026-04-03T08:42:08Z)
• Inverse nonlinear fast Fourier transform on SU(2) with applications to quantum signal processing [10.193028145901248]
  We investigate the inverse NLFT on $mathrmSU(2)$ and establish the numerical stability of the layer stripping algorithm for the first time.<n>We develop a fast and numerically stable algorithm, called inverse nonlinear fast Fourier transform, for performing inverse NLFT with near-linear complexity.
  arXiv  Detail & Related papers  (2025-05-19T01:57:04Z)
• Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent [0.0]
  Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures.<n>Recent research showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability.
  arXiv  Detail & Related papers  (2025-03-04T22:02:38Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Transform Once: Efficient Operator Learning in Frequency Domain [69.74509540521397]
  We study deep neural networks designed to harness the structure in frequency domain for efficient learning of long-range correlations in space or time. This work introduces a blueprint for frequency domain learning through a single transform: transform once (T1)
  arXiv  Detail & Related papers  (2022-11-26T01:56:05Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• Quantum Augmented Dual Attack [8.134961550216618]
  We present a quantum augmented variant of the dual lattice attack on the Learning with Errors (LWE) problem, using classical memory with quantum random access (QRACM) Applying our results to lattice parameters from the literature, we find that our algorithm outperforms previous algorithms, assuming unit cost access to a QRACM.
  arXiv  Detail & Related papers  (2022-05-27T13:54:31Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Quantum Fourier Transform Revisited [3.23402688755667]
  We show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer.
  arXiv  Detail & Related papers  (2020-03-06T02:46:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.