The field of quantum computing has gained much attention in recent years due to further advances in the development of quantum computers and the recognition that this new paradigm will greatly endanger many modern encryption practices. This paper gives analysis of some of these algorithms, notably Grover’s database search algorithm, and Shor’s factoring and discrete log algorithms, from the perspective of linear algebra. The consequences these have for modern cryptography are discussed, and a brief overview of the current state of the field is given. Without assuming a physics background, this paper aims to provide a self-contained and mathematically rigorous explanation of quantum algorithms for an undergraduate audience.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Baker, Lauren Michelle
• Ogren, Liam Michael

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-042717-165317

Advisor

• Aravind, Padmanabhan K.
• Martin, William J.

Year

• 2017

Date created

• 2017-04-27

Resource type

• Major Qualifying Project

Major

• Interdisciplinary

Rights statement

• In Copyright