skip to main content
research-article

An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model

Published:03 February 2016Publication History
Skip Abstract Section

Abstract

Obtaining a nontrivial (superlinear) lower bound for computation of the Fourier transform in the linear circuit model has been a long-standing open problem for more than 40 years. An early result by Morgenstern from 1973, provides an Ω(nlog 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. That result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, it 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) 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). This work improves on Ailon [2013] in two ways: First, we eliminate the scaling restriction and provide a lower bound for computing any scaling of the Fourier transform. Second, we allow the computational model to use extra memory. 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), where R is the uniform condition number. Well-conditioned is a natural requirement for algorithms accurately computing linear transformations on machine architectures of bounded word size. Hence, this result can be seen as a tradeoff between speed and accuracy. The main technical contribution is an extension of matrix entropy used in Ailon [2013] for unitary matrices to a potential function computable for any invertible matrix, using “quasi-entropy” of “quasi-probabilities.”

References

  1. Nir Ailon. 2013. A lower bound for fourier transform computation in a linear model over 2x2 unitary gates using matrix entropy. Chicago J. of Theo. Comp. Sci. (2013).Google ScholarGoogle Scholar
  2. Nir Ailon. 2015. Tighter fourier transform complexity tradeoffs. arxiv (2015).Google ScholarGoogle Scholar
  3. Isaac L. Chuang and Michael A. Nielsen. 2010. Quantum Computation and Quantum Information. Cambridge University Press.Google ScholarGoogle Scholar
  4. J. W. Cooley and J. W Tukey. 1964. An algorithm for the machine computation of complex Fourier series. J. of American Math. Soc. (1964), 297--301.Google ScholarGoogle Scholar
  5. Gene H. Golub and Charles F. van Loan. 1989. Matrix Computations (2 ed.). Johns Hopkins University Press.Google ScholarGoogle Scholar
  6. Jacques Morgenstern. 1973. Note on a lower bound on the linear complexity of the fast fourier transform. J. ACM 20, 2 (April 1973), 305--306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Christos H. Papadimitriou. 1979. Optimality of the fast fourier transform. J. ACM 26, 1 (Jan. 1979), 95--102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ran Raz and Amir Yehudayoff. 2011. Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77, 1 (2011), 167--190. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Winograd. 1976. On computing the discrete fourier transform. Proc. Nat. Assoc. Sci. 73, 4 (1976), 1005--1006.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 8, Issue 1
      February 2016
      97 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/2889309
      Issue’s Table of Contents

      Copyright © 2016 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 February 2016
      • Accepted: 1 November 2015
      • Revised: 1 July 2015
      • Received: 1 February 2015
      Published in toct Volume 8, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!