Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0010034

Shor's Quantum Factoring Algorithm

Samuel J. Lomonaco

Published Oct 9, 2000• 3 citations
arXivHTMLPDF

Abstract

This paper is a written version of a one hour lecture given on Peter Shor's quantum factoring algorithm.
DOI
10.48550/arxiv.quant-ph/0010034

Related papers

Using Single Time of Quantum Computer for Shor's Factoring Algorithm

Yousef Alhammadi

Peter Shor's in 1994 developed a factoring algorithm that can factor a composite number$\boldsymbol{n}$in a polynomial time by using a quantum computer in one step of the algorithm. The algorithm may contain a loop that requires calling a quantum computer many times to find the order of selected number$a, a\in Z_{n}$. In this paper, the improvement to the Shor's factoring algorithm guarantees the single use of the quantum computer to find the order, where the rest of the algorithm can be implemented by a classical computer. A numerical example for the original and improved version is presented.

International Conference on IT Innovation and Knowledge Discovery (ITIKD)•Mar 8, 2023•0 citations

Shor’s Algorithm for Quantum Factoring

Manisha J. Nene, Gaurav K. Upadhyay

Advances in intelligent systems and computing•Jan 1, 2016•14 citations

Study on Implementation of Shor’s Factorization Algorithm on Quantum Computer

Mandeep Kumar, Bhaskar Mondal

SN Computer Science•Apr 8, 2024•33 citations

Mathematical Analysis and Simulation of Shor's Algorithm and the Quantum Fourier Transform

Marcus Ahlström, Peda Dizdarevic, Patrik Henelius

In 1994, Peter Shor presented an algorithm for integer factorization that used exponentiallyless operations than the most efficient known algorithm. His algorithm requiresthe use of a quantum computer, a theoretical computational device using quantum mechanicaleffects not utilized in contemporary computers. In this paper we have analysedthe mathematics behind Shor’s algorithm and the quantum circuits on which it operates.We have also studied the Quantum Fourier Transform, a central component of Shor’sAlgorithm. Furthermore we have written a program in C++ to simulate a quantum circuitperforming Shor’s algorithm and the quantum Fourier transform. We were able tounderstand the critical parts of Shor’s algorithm that contribute with the great increasein efficiency compared to classical algorithms.

•Jan 1, 2012•1 citation

Shor Algorithm

Ray LaPierre

In 1994, a mathematician named Peter Shor surprised the world by publishing an efficient quantum algorithm for finding the prime factors of very large numbers, which is the basis for today’s data encryption. This discovery spurred the further development of quantum computing, making Shor’s algorithm one of the most important algorithms.

The Materials Research Society series•Oct 24, 2025•0 citations

3 Factorization with Quantum Computers: Shor’s Algorithm

Daniel Neuenschwander

Lecture notes in computer science•Jan 1, 2004•0 citations
Peter Shor's in 1994 developed a factoring algorithm that can factor a composite numbern\boldsymbol{n}nin a polynomial time by using a quantum computer in one step of the algorithm. The algorithm may contain a loop that requires calling a quantum computer many times to find the order of selected numbera,a∈Zna, a\in Z_{n}a,a∈Zn​. In this paper, the improvement to the Shor's factoring algorithm guarantees the single use of the quantum computer to find the order, where the rest of the algorithm can be implemented by a classical computer. A numerical example for the original and improved version is presented.
In 1994, Peter Shor presented an algorithm for integer factorization that used exponentiallyless operations than the most efficient known algorithm. His algorithm requiresthe use of a quantum computer, a theoretical computational device using quantum mechanicaleffects not utilized in contemporary computers. In this paper we have analysedthe mathematics behind Shor’s algorithm and the quantum circuits on which it operates.We have also studied the Quantum Fourier Transform, a central component of Shor’sAlgorithm. Furthermore we have written a program in C++ to simulate a quantum circuitperforming Shor’s algorithm and the quantum Fourier transform. We were able tounderstand the critical parts of Shor’s algorithm that contribute with the great increasein efficiency compared to classical algorithms.