Abstract
We present a brief overview of the Fourier series, the Fourier and discrete Fourier transforms and their applications. We discuss a quantum algorithm that encodes the Fourier transform of the mapping f : {0, 1}n →{0, 1} in an n-qubit register. It’s shown how the quantum Fourier transform (QFT) gate is constructed from single-qubit phase and two-qubit control gates. Due to the collapse postulate, the quantum Fourier transform for f is not available in a register query, but it does allow efficient period estimation. We illustrate how the QFT is exploited in the Shor algorithm for factoring large numbers. On the average, search for an item in an unordered list of size N requires N∕2 queries. We show how the Grover quantum algorithm improves on this figure of merit as it requires resources that scale as \(\sqrt {N}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The general case is discussed in Mathematica Notebook 4.3.
- 2.
If r is not an even integer, try a different seed x.
References
Michael E. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge U. Press, 2011
William H. Press, Saul A. Teukolsky, William T. Vetterling, Brian P. Flannery, Numerical Recipes: The Art of Scientific Computing, 3rd edn. (Cambridge University Press, 2007)
Wikipedia entry for Killer application. https://en.wikipedia.org/wiki/Killer_application
Paul, Zimmermann, Factorisation of RSA-220 with CADO-NFS, Cado-nfs-discuss, https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2016-May/000626.html
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Zygelman, B. (2018). Quantum Killer Apps: Quantum Fourier Transform and Search Algorithms. In: A First Introduction to Quantum Computing and Information. Springer, Cham. https://doi.org/10.1007/978-3-319-91629-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-91629-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91628-6
Online ISBN: 978-3-319-91629-3
eBook Packages: Computer ScienceComputer Science (R0)