Quantum Fourier Transform Revisited

  title={Quantum Fourier Transform Revisited},
  author={Daan Camps and R. V. Beeumen and C. Yang},
  journal={Numer. Linear Algebra Appl.},
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, 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… Expand
2 Citations
Low Rank Approximation in Simulations of Quantum Algorithms
  • Linjian Ma, Chao Yang
  • Computer Science, Mathematics
  • ArXiv
  • 2021
  • PDF
Quantum Fourier Operators and Their Application
  • PDF


Superfast Fourier Transform Using QTT Approximation
  • 52
  • PDF
Matrix representations for sorting and the fast Fourier transform
  • 31
Quantum fast Fourier transform using multilevel atoms
  • 25
  • PDF
An algorithm for the machine calculation of complex Fourier series
  • 10,762
  • Highly Influential
  • PDF
An Adaptation of the Fast Fourier Transform for Parallel Processing
  • 379
  • Highly Influential
QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
  • 12
  • PDF
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 1996
  • 658
Implementation of the quantum Fourier transform on a hybrid qubit–qutrit NMR quantum emulator
  • 5
  • PDF
Quantum Fourier Transform and Phase Estimation in Qudit System
  • 13
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2007
  • 15,447