# An improved quantum Fourier transform algorithm and applications

@article{Hales2000AnIQ,
title={An improved quantum Fourier transform algorithm and applications},
author={Lisa Hales and Sean Hallgren},
journal={Proceedings 41st Annual Symposium on Foundations of Computer Science},
year={2000},
pages={515-525}
}
• Published 12 November 2000
• Mathematics, Computer Science
• Proceedings 41st Annual Symposium on Foundations of Computer Science
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z/sub p/ which requires only O(n log n) steps where n=log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of A.Y. Kitaev (1995) which requires time quadratic in n. This algorithm also leads to a general and efficient Fourier sampling technique which improves upon the quantum Fourier sampling lemma of L. Hales and S. Hallgren (1997). As an application of…
141 Citations
Exact quantum Fourier transforms and discrete logarithm algorithms
• Physics
• 2003
We show how the Quantum Fast Fourier Transform (QFFT) can be made exact for arbitrary orders (first showing it for large primes). Most quantum algorithms only need a good approximation of the quantum
The quantum fourier transform and extensions of the abelian hidden subgroup problem
Improved parallel circuits for both the QFT over a power of 2 and the Q FT over an arbitrary cyclic group are given and it is shown that this problem of period-finding over ℜ, viewed as an oracle promise problem, is strictly harder than its integral counterpart.
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
• Computer Science
MMICS
• 2008
This work shows that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer and uses Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations.
Representation-theoretical properties of the approximate quantum Fourier transform
• Computer Science
Applicable Algebra in Engineering, Communication and Computing
• 2008
Among the transformations used in quantum computing the discrete Fourier transform (DFT) plays a key role. A striking fact is that the computational complexity of the DFT with respect to the quantum
Quantum Fourier transform in computational basis
• Computer Science
Quantum Inf. Process.
• 2017
A new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity 1 - \delta 1-δ and digit accuracy ϵ for each Fourier coefficient is detailed.
Quantum Fourier Operators and Their Application
• E. Sakk
• Computer Science
Real Perspective of Fourier Transforms and Current Developments in Superconductivity
• 2021
This work reviews the structure of the quantum Fourier transform and its implementation, and provides a permutation structure for putting the QFT within the context of universal computation.
Generic quantum Fourier transforms
• Mathematics
SODA '04
• 2004
This paper uses Bratteli diagrams, Gel'fand-Tsetlin bases, and strong generating sets of small adapted diameter to provide efficient quantum circuits for the QFT over a wide variety of finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families.
Quantum Fourier transforms for extracting hidden linear structures in finite fields
• Computer Science, Mathematics
• 2000
A problem that requires Ω(2) queries in the classical case, but can be solved exactly with a single query in the quantum case using a polynomial number of auxiliary operations is defined.
Quantum algorithms: A survey of some recent results
• M. Rötteler
• Computer Science, Physics
Informatik - Forschung und Entwicklung
• 2006
An overview of the known quantum algorithms and briefly describe the underlying ideas are given, which have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved.

## References

SHOWING 1-10 OF 28 REFERENCES
Quantum Fourier sampling simplified
• Computer Science
STOC '99
• 1999
It is shown that the distribution sampled after a Fourier transform over Zp can be efficiently approximated by transforming over Z, for any q in a large range, which places no restrictions on the superposition to be transformed.
An exact quantum polynomial-time algorithm for Simon's problem
• Computer Science, Mathematics
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
• 1997
It is shown that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.
Quantum complexity theory
• Computer Science
STOC '93
• 1993
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
• Computer Science, Mathematics
CRYPTO
• 1995
It is shown that any cryptosystem based on what is referred to as a ‘hidden linear form’ can be broken in quantum polynomial time and the notion of ‘junk bits’ is introduced which are helpful when performing classical computations that are not injective.
On the power of quantum computation
• Daniel R. Simon
• Computer Science
Proceedings 35th Annual Symposium on Foundations of Computer Science
• 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.
Algorithms for quantum computation: discrete logarithms and factoring
• P. Shor
• Computer Science
Proceedings 35th Annual Symposium on Foundations of Computer Science
• 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
Quantum measurements and the Abelian Stabilizer Problem
• A. Kitaev
• Mathematics
Electron. Colloquium Comput. Complex.
• 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• P. Shor
• Computer Science
SIAM Rev.
• 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Semiclassical Fourier transform for quantum computation.
• Physics, Computer Science
Physical review letters
• 1996
It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for factorization on a quantum computer can be carried out in a semiclassical way by using the classical''
Quantum algorithms and the Fourier transform
• R. Jozsa
• Computer Science
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
• 1998
The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform and an efficient quantum factoring algorithm based on a general formalism of Kitaev is described.