TY - GEN
T1 - Optimizing Shor’s Algorithm for N=15 and 21
AU - Herr, Gabriele
AU - Qian, Xiao Feng
N1 - Publisher Copyright:
© Optica Publishing Group 2025.
PY - 2025
Y1 - 2025
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/105033337905
UR - https://www.scopus.com/pages/publications/105033337905#tab=citedBy
U2 - 10.1364/cleo_at.2025.ps200_207
DO - 10.1364/cleo_at.2025.ps200_207
M3 - Conference contribution
AN - SCOPUS:105033337905
T3 - CLEO: Applications and Technology - Proceedings CLEO 2025
BT - CLEO
T2 - 2025 CLEO: Applications and Technology, CLEO-AT 2025
Y2 - 4 May 2025 through 9 May 2025
ER -