Quantum Fourier Transforms and Integer Multiplication - Graeme Ahokas

The quantum Fourier transform (QFT) is a key ingredient in many quantum algorithms. In this talk we present efficient circuit constructions for both the exact and approximate QFT, and relate the difficulty of computing the QFT to classical integer multiplication.