Quantum Algorithms Wocjan, Pawel; Childs, Andrew
Quantum information offers the possibility to solve certain problems dramatically faster than is possible with classical computers. In these lectures, we will give an introduction to quantum algorithms. We will begin with an overview of the quantum circuit model and some elementary examples of quantum speedup. Next, we will introduce the quantum Fourier transform and show how it can be used to estimate the eigenvalues of a unitary operator. Using phase estimation, we will describe Shor's algorithm for factoring integers. We will also describe Grover's search algorithm, and will conclude with a discussion of recent quantum algorithms based on quantum analogs of random walks.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International