Introduction to Grover Algorithm

Wen Shao

An introduction about the basis and fulfilment of quantum Grover algorithm is provided,as well as its application in exhaustive searching.The superiority of quantum algorithms over classical ones can be seen therefrom.

Ray LaPierre

Anna Maria Houk

In the sub-field of quantum algorithms, physicists and computer scientist take classical computing algorithms and principles and see if there is a more efficient or faster approach implementable on a quantum computer, i.e. a ”quantum advantage”. We take random walks, a widely applicable group of classical algorithms, and move them into the quantum computing paradigm. Additionally, an introduction to a popular quantum search algorithm called Grover’s search is included to guide the reader to the development of a quantum search algorithm using quantum random walks. To close the gap between algorithm and hardware, we will look at using neutral-atom (also known as cold-atom) quantum computing to physically implement two types of quantum random walks and Grover’s algorithm.

Ray LaPierre

Giacomo Nannicini

This paper is a gentle but rigorous introduction to quantum computing intended for discrete mathematicians. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics, stressing the differences with classical computers, and finally describe two well-known algorithms (Simon's algorithm and Grover's algorithm) using the formalism developed in previous sections. This paper does not touch on the physics of the devices, and therefore does not require any notion of quantum mechanics. Numerical examples based on an implementation of Grover's algorithm using open-source software are provided.

Issac Diana Jeba Jingle, Sharlene Anna Pereira