Show simple item record

dc.contributor.advisorXu, Hongguo
dc.contributor.authorValle, Chris
dc.date.accessioned2011-06-21T19:36:22Z
dc.date.available2011-06-21T19:36:22Z
dc.date.issued2011-04-25
dc.date.submitted2011
dc.identifier.otherhttp://dissertations.umi.com/ku:11507
dc.identifier.urihttp://hdl.handle.net/1808/7674
dc.description.abstractIn this paper we will analyse two quantum algorithms that sparked interest in the potential of quantum computers. The first is Lov Grover's algorithm which may be used to conduct a type of database search. The second is Peter Shor's algorithm which may be used to factor large numbers and provides an exponential speed up over the best current classical algorithms. In the context of these two algorithms we will discuss the benefits and weaknesses of quantum computation. We will show that in exchange for a quantum computer's greater speed we must accept an inherent level of uncertainty in our results.
dc.format.extent33 pages
dc.language.isoen
dc.publisherUniversity of Kansas
dc.rightsThis item is protected by copyright and unless otherwise specified the copyright of this thesis/dissertation is held by the author.
dc.subjectMathematics
dc.subjectComputer science
dc.subjectPhysics
dc.subjectAlgorithm
dc.subjectGrover
dc.subjectQuantum computer
dc.subjectShor
dc.subjectSuperposition
dc.titleShor's Algorithm and Grover's Algorithm in Quantum Computing
dc.typeThesis
dc.contributor.cmtememberVan Vleck, Erik
dc.contributor.cmtememberHuang, Weizhang
dc.thesis.degreeDisciplineMathematics
dc.thesis.degreeLevelM.A.
kusw.oastatusna
kusw.oapolicyThis item does not meet KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record