Period Finding on a Quantum Computer Using Shor’s Algorithm

Marcillo-Gomez, Samuel

Peacock Scholarship

Period Finding on a Quantum Computer Using Shor’s Algorithm

Public Deposited

In recent years, there have been numerous developments in quantum computation. These developments have brought into question, how quantum computers could affect security have risen. For instance, Shor’s algorithm is believed to be able to break certain encryptions faster on a perfect quantum computer faster than on, what is known as, classical computers. In a few years or decades, there could be significant developments made that allow for quantum computers to perform Shor’s Algorithm. As quantum computers exist now, the implementation of the algorithm is known to be difficult as the computes are very basic. Attempts to create quantum circuits that can compute Shor’s Algorithms aid in the understanding of the algorithm.

Last modified