An Omega((n n)/R) lower bound for Fourier transform computation in the R-well conditioned model

DOI10.1145/2858785MaRDI QIDQ2828217zbMATH OpenOpenAlexFDO

Authors Nir Ailon

Publication date 24 October 2016

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.1307

zbMATH Keywords

Fourier transformlower bounds

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: 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(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 $Omega(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 $Omega(R^{-1}nlogn)$, 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".

Recommendations

• A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy
• Tighter Fourier transform lower bounds
• Paraunitary matrices, entropy, algebraic condition number and Fourier computation
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
• Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer

Cites work

• A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy
• An Algorithm for the Machine Calculation of Complex Fourier Series
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On computing the Discrete Fourier Transform
• Optimality of the Fast Fourier transform
• Quantum computation and quantum information. 10th anniversary edition
• Tighter Fourier transform lower bounds

Cited in

(6)

• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
• Paraunitary matrices, entropy, algebraic condition number and Fourier computation
• Tighter Fourier transform lower bounds
• On the complexity of unitary transformations
• A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy
• Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity

This page was built for publication: An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828217)