Exact quantum Fourier transforms and discrete logarithm algorithms (2004) [3 citations — 0 self]
Abstract:
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 transform of order 2 n is needed, and this can be done exactly. Kitaev [9] showed how to approximate the Fourier transform for any order. Here we show how his construction can be made exact by using the technique known as "amplitude amplification". Although unlikely to be of any practical use, this construction e.g. allows to make Shor's discrete logarithm quantum algorithm exact. Thus we have the first example of an exact non black box fast quantum algorithm, thereby giving more evidence that "quantum " need not be probabilistic. We also show that in a certain sense the family of circuits for the exact QFFT is uniform. Namely the parameters of the gates can be calculated e#ciently. 1
Citations
| 412 | Algorithms for quantum computation: Discrete log and factoring – Shor - 1994 |
| 64 | An exact quantum polynomial-time algorithm for simon’s problem – Brassard, Hoyer - 1997 |
| 55 | Quantum Algorithms Revisited – Cleve, Ekert, et al. - 1996 |
| 23 | An improved quantum fourier transform algorithm and applications – Hales, Hallgren - 2000 |
| 18 | Semiclassical Fourier transform for quantum computation – Griffiths, Niu - 1996 |
| 18 | Quantum algorithms and the Fourier transform – Jozsa - 1998 |
| 11 | A note on computing Fourier transforma-tion by quantum programs – Cleve - 1994 |
| 4 | Shor's discrete logarithm quantum algorithm for elliptic curves – Proos, Zalka - 1987 |
| 1 | On the Quantum Derandomization of Algorithms, manuscript in preparation; based on presentation at – Mosca - 2002 |
