Optimizing Shor's Algorithm for N=15 and 21

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate the optimization of Shor's algorithm by exploring the factorization of N = 15 and N = 21. A simplified three-qubit circuit is found to successfully factor both cases when the testing integer numbers are appropriately chosen.

Original languageEnglish
Title of host publication2025 Conference on Lasers and Electro-Optics, CLEO 2025
ISBN (Electronic)9781957171500
StatePublished - 2025
Event2025 Conference on Lasers and Electro-Optics, CLEO 2025 - Long Beach, United States
Duration: 4 May 20259 May 2025

Publication series

Name2025 Conference on Lasers and Electro-Optics, CLEO 2025

Conference

Conference2025 Conference on Lasers and Electro-Optics, CLEO 2025
Country/TerritoryUnited States
CityLong Beach
Period4/05/259/05/25

Fingerprint

Dive into the research topics of 'Optimizing Shor's Algorithm for N=15 and 21'. Together they form a unique fingerprint.

Cite this