College - Author 1
College of Engineering
Department - Author 1
Computer Engineering Department
Degree Name - Author 1
BS in Computer Engineering
Date
6-2020
Primary Advisor
Katharina Gillen, College of Science and Mathematics, Physics Department
Abstract/Summary
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.
URL: https://digitalcommons.calpoly.edu/physsp/184
Included in
Atomic, Molecular and Optical Physics Commons, Quantum Physics Commons, Theory and Algorithms Commons