Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1907.07471

Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory

Nir Ailon

Published Jul 17, 2019• 0 citations
arXivHTMLPDF

Abstract

The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a lower bound perspective, relatively little is known. Ailon shows in 2013 an $Ω(n\log n)$ bound for computing the normalized Fourier Transform assuming only unitary operations on pairs of coordinates is allowed. The goal of this document is to describe a natural open problem that arises from this work, which is related to group theory, and in particular to representation theory.

DOI
10.48550/arxiv.1907.07471

Related papers

The Complexity of Computing (Almost) Unitary Matrices With $\eps$-Copies of the Fourier Transform

Nir Ailon, Gal Yehuda

The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitations. This paper, motivated by one such limitation, partly overcomes it, while at the same time sheds llight on new interesting, and problems on the intersection of computational complexity and group theory. The paper also explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform.

arXiv:1604.02557•Apr 9, 2016•0 citations

The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform

Nir Ailon, Gal Yehuda

The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitations. This paper is motivated by one such limitation, related to the computation of near-orthogonal matrices that have the Fourier transform ‘hidden’ in low-order bits. While partly overcoming this limitation, the paper sheds light on new interesting, open problems on the intersection of computational complexity and group theory. The paper also explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform.

Information Processing Letters•Sep 14, 2020•0 citations

An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model

Nir Ailon

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $Ω(n \log n)$ lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive. More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used, and additionally no extra memory is allowed, then the normalized Fourier transform requires $Ω(n\log n)$ steps. This rather limited result is also sensitive to scaling, but highlights the complexity inherent in the Fourier transform arising from introducing entropy, unlike, say, the identity matrix (which is as complex as the Fourier transform using Morgenstern's arguments, under proper scaling). In this work we extend the arguments of Ailon (2013). In the first extension, which is also the main contribution, we provide a lower bound for computing any scaling of the Fourier transform. Our restriction is that, the composition of all gates up to any point must be a well conditioned linear transformation. The lower bound is $Ω(R^{-1}n\log n)$, where $R$ is the uniform condition number. Second, we assume extra space is allowed, as long as it contains information of bounded norm at the end of the computation. The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on "quasi-probabilities".

arXiv:1403.1307•Mar 6, 2014•7 citations

A Lower Bound for Fourier Transform Computation in a Linear Well Conditioned Model

Nir Ailon

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n \log n)$ lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive. More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used, and additionally no extra memory is allowed, then the normalized Fourier transform requires $\Omega(n\log n)$ steps. This rather limited result is also sensitive to scaling, but highlights the complexity inherent in the Fourier transform arising from introducing entropy, unlike, say, the identity matrix (which is as complex as the Fourier transform using Morgenstern's arguments, under proper scaling). In this work we extend the arguments of Ailon (2013). In the first extension, which is also the main contribution, we provide a lower bound for computing any scaling of the Fourier transform. Our restriction is that, the composition of all gates up to any point must be a well conditioned linear transformation. The lower bound is $\Omega(R^{-1}n\log n)$, where $R$ is the uniform condition number. Second, we assume extra space is allowed, as long as it contains information of bounded norm at the end of the computation. The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on quasi-probabilities.

•Mar 6, 2014•0 citations

On the Fast Fourier Transform on SU(2)

Julio Delgado, Alejandro Umaña

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.

physics.comp-phCross-listedarXiv:2605.23923•Apr 21, 2026

Fourier Transform Evolution from DFT to FFT to QFT: the Journey of Cost Reduction from $O\left(N^{2}\right)$ to $O(N \log N)$ to $O\left(\log ^{2} N\right)$

Chris Nguyễn, Vladimir Okhmatovski

Paper provides description of methods for Discrete Fourier Transform computation from direct$O\left(N^{2}\right)$approach to its$O(N \log N)$evaluation with FFT, to$O\left(\log ^{2} N\right)$complexity Quantum Fourier Transform algorithm. It can serve as an introduction for computational electromagnetics (CEM) engineers to quantum information processing using an example of a familiar algorithm. We also outline the key role of QFT in Quantum Phase Estimation method foundational to solution of matrix equations arising from Method of Moments (MoM) and Finite Element Method (FEM) on quantum computers.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 13, 2025•0 citations
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time O(nlog⁡n)O(n\log n)O(nlogn). From a lower bound perspective, relatively little is known. Ailon shows in 2013 an Ω(nlog⁡n)Ω(n\log n)Ω(nlogn) bound for computing the normalized Fourier Transform assuming only unitary operations on pairs of coordinates is allowed. The goal of this document is to describe a natural open problem that arises from this work, which is related to group theory, and in particular to representation theory.
The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitations. This paper, motivated by one such limitation, partly overcomes it, while at the same time sheds llight on new interesting, and problems on the intersection of computational complexity and group theory. The paper also explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform.
The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitations. This paper is motivated by one such limitation, related to the computation of near-orthogonal matrices that have the Fourier transform ‘hidden’ in low-order bits. While partly overcoming this limitation, the paper sheds light on new interesting, open problems on the intersection of computational complexity and group theory. The paper also explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform.
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an Ω(nlog⁡n)Ω(n \log n)Ω(nlogn) lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive. More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used, and additionally no extra memory is allowed, then the normalized Fourier transform requires Ω(nlog⁡n)Ω(n\log n)Ω(nlogn) steps. This rather limited result is also sensitive to scaling, but highlights the complexity inherent in the Fourier transform arising from introducing entropy, unlike, say, the identity matrix (which is as complex as the Fourier transform using Morgenstern's arguments, under proper scaling). In this work we extend the arguments of Ailon (2013). In the first extension, which is also the main contribution, we provide a lower bound for computing any scaling of the Fourier transform. Our restriction is that, the composition of all gates up to any point must be a well conditioned linear transformation. The lower bound is Ω(R−1nlog⁡n)Ω(R^{-1}n\log n)Ω(R−1nlogn), where RRR is the uniform condition number. Second, we assume extra space is allowed, as long as it contains information of bounded norm at the end of the computation. The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on "quasi-probabilities".
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an Ω(nlog⁡n)\Omega(n \log n)Ω(nlogn) lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive. More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used, and additionally no extra memory is allowed, then the normalized Fourier transform requires Ω(nlog⁡n)\Omega(n\log n)Ω(nlogn) steps. This rather limited result is also sensitive to scaling, but highlights the complexity inherent in the Fourier transform arising from introducing entropy, unlike, say, the identity matrix (which is as complex as the Fourier transform using Morgenstern's arguments, under proper scaling). In this work we extend the arguments of Ailon (2013). In the first extension, which is also the main contribution, we provide a lower bound for computing any scaling of the Fourier transform. Our restriction is that, the composition of all gates up to any point must be a well conditioned linear transformation. The lower bound is Ω(R−1nlog⁡n)\Omega(R^{-1}n\log n)Ω(R−1nlogn), where RRR is the uniform condition number. Second, we assume extra space is allowed, as long as it contains information of bounded norm at the end of the computation. The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on quasi-probabilities.
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.
Fourier Transform Evolution from DFT to FFT to QFT: the Journey of Cost Reduction from O(N2)O\left(N^{2}\right)O(N2) to O(Nlog⁡N)O(N \log N)O(NlogN) to O(log⁡2N)O\left(\log ^{2} N\right)O(log2N)
Paper provides description of methods for Discrete Fourier Transform computation from directO(N2)O\left(N^{2}\right)O(N2)approach to itsO(Nlog⁡N)O(N \log N)O(NlogN)evaluation with FFT, toO(log⁡2N)O\left(\log ^{2} N\right)O(log2N)complexity Quantum Fourier Transform algorithm. It can serve as an introduction for computational electromagnetics (CEM) engineers to quantum information processing using an example of a familiar algorithm. We also outline the key role of QFT in Quantum Phase Estimation method foundational to solution of matrix equations arising from Method of Moments (MoM) and Finite Element Method (FEM) on quantum computers.