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

Springer eBooks

Quantum Algorithms for Integer Factorization

Song Yuan Yan

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-319-25823-2_3

Related papers

Variational Quantum Computation Integer Factorization Algorithm

Xinglan Zhang, Feng Zhang

International Journal of Theoretical Physics•Nov 15, 2023•4 citations

Isomorphism and Factorization – Classical and Quantum Algorithms

Sebastian Dörn, Daniel Haase, Jacobo Torán +1 more

This chapter contains sections titled: Introduction Factorization of Integers: Classical Algorithms Graph Isomorphism: Classical Algorithms Quantum Algorithms for Integer Factorization Quantum Approach to Graph Isomorphism Reductions of Integer Factorization and Graph Isomorphism to Ring Isomorphism References

Wiley eBooks•Mar 18, 2009•2 citations

Quantum algorithms for factorization problem

Xinhua Peng

•Sep 3, 2016•0 citations

Quantum Factorization of Integers

WORLD SCIENTIFIC eBooks•Jul 1, 1998•0 citations

Quantum Computing Algorithms for Integer Factorization: A Comparative Analysis

Nadia Ahmed

The field of quantum computing has witnessed remarkable advancements in recent years, particularly in its potential applications to solve computationally hard problems such as integer factorization. a comparative analysis of quantum computing algorithms for integer factorization, focusing on their theoretical foundations, computational complexity, and practical implications. We review prominent algorithms such as Shor's algorithm, which leverages quantum parallelism and period finding to efficiently factor large composite integers, and compare them with classical factorization algorithms like the General Number Field Sieve (GNFS). Through a comprehensive examination of algorithmic strategies, runtime complexities, and quantum circuit implementations, we assess the relative strengths and limitations of quantum computing approaches for integer factorization. Furthermore, we discuss potential challenges and future research directions in harnessing the power of quantum computing to address cryptographic security and algorithmic complexity in the era of post-quantum cryptography.

Modern Dynamics: Mathematical Progressions.•May 25, 2024•9 citations

Algorithm for Quantum Factorization

Samuel Čarnoký

•Jan 1, 2008•0 citations
The field of quantum computing has witnessed remarkable advancements in recent years, particularly in its potential applications to solve computationally hard problems such as integer factorization. a comparative analysis of quantum computing algorithms for integer factorization, focusing on their theoretical foundations, computational complexity, and practical implications. We review prominent algorithms such as Shor's algorithm, which leverages quantum parallelism and period finding to efficiently factor large composite integers, and compare them with classical factorization algorithms like the General Number Field Sieve (GNFS). Through a comprehensive examination of algorithmic strategies, runtime complexities, and quantum circuit implementations, we assess the relative strengths and limitations of quantum computing approaches for integer factorization. Furthermore, we discuss potential challenges and future research directions in harnessing the power of quantum computing to address cryptographic security and algorithmic complexity in the era of post-quantum cryptography.