Simulation of Shor’s Algorithm
dc.contributor.author | Saling, Brennan | |
dc.date.accessioned | 2020-04-23T13:25:24Z | |
dc.date.available | 2020-04-23T13:25:24Z | |
dc.date.issued | 2020 | |
dc.identifier.uri | https://dspace.sewanee.edu/handle/11005/21711 | |
dc.description.abstract | A 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.sponsorship | Dr. Randolph Peterson | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | University of the South | en_US |
dc.subject | Scholarship Sewanee 2020 | en_US |
dc.subject | Shor's Algorithm | en_US |
dc.subject | Quantum computing | en_US |
dc.title | Simulation of Shor’s Algorithm | en_US |
dc.type | Presentation | en_US |