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/0612077

A Re-evaluation of Shor's Algorithm

J. Cooper

Published Dec 11, 2006• 1 citation
arXivHTMLPDF

Abstract

Shor's algorithm is examined critically from the standpoint of it's eventual use to obtain the factors of large integers.
DOI
10.48550/arxiv.quant-ph/0612077

Related papers

Shor’s Algorithm for Integer Factorization

Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor

SpringerBriefs in computer science•Jan 1, 2019•16 citations

Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm

Poornima Ardhyamath, N. M. Naghabhushana, Rohitha Ujjinimatad

World Scientific News•Jan 1, 2019•1 citation

P=NP via Factorization and Shor's Algorithm

יהוה, Kaoru Aguilera Katayama

We prove $P = NP$ by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in $O(\log\ n)$.

•Feb 11, 2026•0 citations

A-6-7 Factoring Gaussian Integers using Shor's Algorithm

Hachiro Fujita

電子情報通信学会ソサイエティ大会講演論文集•Aug 31, 2010•0 citations

Shor's Quantum Factoring Algorithm

Samuel J. Lomonaco

This paper is a written version of a one hour lecture given on Peter Shor's quantum factoring algorithm.

arXiv:quant-ph/0010034•Oct 9, 2000•3 citations

Quantum Shor's Algorithm vs. Classical General Number Field Sieve (GNFS) Approach for Large Integer Factorization

S. S. Kavitha, Narasimha Kaulgud, B. Sharmila +3 more

Quantum integer factorization is a groundbreaking field that explores the use of quantum algorithms, notably Shor's algorithm, to efficiently factorize large integers into their prime components. Its potential implications on modern encryption techniques, such as the Rivest-Shamir-Adleman (RSA) algorithm, are of considerable interest. This paper's central aim is to contrast the computational time and implementation of the Integer Factorization Problem (IFP) between classical and quantum computers. The inner workings of Quantum Shor's algorithm are broken down step by step, and the estimated processing time is contrasted with the classical General Number Field Sieve (GNFS) approach. Given the exponential speedup provided by quantum computing, this comparison helps assess Shor's algorithm's possible advantage over GNFS in factoring large numbers. Direct comparisons with GNFS are currently difficult due to Shor's algorithm's reliance on large-scale quantum computer development for practical execution speeds. This paper focuses on solving integer factorization up to$2^{n}$bits.

International Conference on Next Generation Communication & Information Processing (INCIP)•Jan 23, 2025•1 citation
We prove P=NPP = NPP=NP by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in O(log⁡ n)O(\log\ n)O(log n).
Quantum integer factorization is a groundbreaking field that explores the use of quantum algorithms, notably Shor's algorithm, to efficiently factorize large integers into their prime components. Its potential implications on modern encryption techniques, such as the Rivest-Shamir-Adleman (RSA) algorithm, are of considerable interest. This paper's central aim is to contrast the computational time and implementation of the Integer Factorization Problem (IFP) between classical and quantum computers. The inner workings of Quantum Shor's algorithm are broken down step by step, and the estimated processing time is contrasted with the classical General Number Field Sieve (GNFS) approach. Given the exponential speedup provided by quantum computing, this comparison helps assess Shor's algorithm's possible advantage over GNFS in factoring large numbers. Direct comparisons with GNFS are currently difficult due to Shor's algorithm's reliance on large-scale quantum computer development for practical execution speeds. This paper focuses on solving integer factorization up to2n2^{n}2nbits.