#### Title of Poster or Paper

### Quantum Computing: A Mathematical Analysis of Shor's Algorithm

#### Mentor/s

Tina Romansky Jason Molitierno

#### Participation Type

Paper Talk

#### Abstract

This paper will explore how quantum computers work from a base level and look at mathematical functions, specifically finding prime factors of large integers. Methods optimized for quantum computers such as Shor’s Algorithm exploit quantum properties and result in solutions that are notably more efficient than the best algorithms executed on classical computers. Finally the paper will define the parameters of an experiment with quantum algorithms and provide quantitative results comparing traditional computers to simulated and physical quantum computers. This will lead to understanding real world effects of quantum algorithms on fields such as Cybersecurity, Computer Science, Optimization and Mathematics.

#### College and Major available

Mathematics, Computer Science & Engineering

#### Location

Digital Commons

#### Start Day/Time

4-24-2020 2:00 PM

#### End Day/Time

4-24-2020 4:00 PM

#### Comments

WAC Writing Prize, First Prize

Quantum Computing: A Mathematical Analysis of Shor's Algorithm

Digital Commons

This paper will explore how quantum computers work from a base level and look at mathematical functions, specifically finding prime factors of large integers. Methods optimized for quantum computers such as Shor’s Algorithm exploit quantum properties and result in solutions that are notably more efficient than the best algorithms executed on classical computers. Finally the paper will define the parameters of an experiment with quantum algorithms and provide quantitative results comparing traditional computers to simulated and physical quantum computers. This will lead to understanding real world effects of quantum algorithms on fields such as Cybersecurity, Computer Science, Optimization and Mathematics.

## Students' Information

Stephen Clarke: Computer Science and Mathematics, Honors, 2020