Exact quantum Fourier transforms and discrete logarithm algorithms

Michele Mosca, Christof Zalka

We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transfor…