Class Year

2019

Date

4-15-2019

Document Type

Thesis

Distinguished Thesis

Yes

Degree Name

Bachelor of Arts (BA)

Department or Program

Mathematics and Computer Science

First Advisor

Robert L. Holliday

Second Advisor

Nathan Mueggenburg

Third Advisor

Craig D. Knuckles

Abstract

Theories about quantum computers and how they would work have been around for a few decades. Peter Shor and Lov Grover even came up with algorithms during the 1990s when the idea of building a quantum computer was far-fetched. We are now at a point where our processors are getting faster and smaller, only a few nanometres thick. This obviously has its limits. Big companies like Google, Microsoft, and IBM are at a point where their quantum computers are equivalent to the room sized computers that we see in some old pictures. Here we build up the necessary background required to understand how quantum computers work and what advantages a quantum computer has over a classical computer. We will also be looking at the famous Grover’s quantum search algorithm and will be using the ideas from that to create our own simple algorithm that finds the minimum value from a given set of data.

Language

English


Share

COinS