Date of Award

2013

Document Type

Thesis

Degree Name

Master of Arts in Mathematics

Department

Mathematics

First Advisor

Freiling, Chris

Second Advisor

Dunn, Correy

Third Advisor

Trapp, Ronald, and Williams, Peter

Abstract

This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates.

Share

COinS