Show simple item record

dc.contributor.authorSaling, Brennan
dc.date.accessioned2020-04-23T13:25:24Z
dc.date.available2020-04-23T13:25:24Z
dc.date.issued2020
dc.identifier.urihttps://dspace.sewanee.edu/handle/11005/21711
dc.description.abstractA Quantum Computing simulation of the commonly cited Shor’s Algorithm. In order to have a better understanding of the inner workings of a Quantum Computer, it’s future applications, and the current and future limitations of classical computing. The simulation uses Shor’s Algorithm to do a series of factorizations, which are most commonly associated with cryptography. The quantum component include Qubits, Quantum Fourier Transforms, and Superposition Period Finders.en_US
dc.description.sponsorshipDr. Randolph Petersonen_US
dc.language.isoen_USen_US
dc.publisherUniversity of the Southen_US
dc.subjectScholarship Sewanee 2020en_US
dc.subjectShor's Algorithmen_US
dc.subjectQuantum computingen_US
dc.titleSimulation of Shor’s Algorithmen_US
dc.typePresentationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record