Quantum Prime Factorization: A Novel Approach Based on Fermat Method
By: Julien Mellaerts
Potential Business Impact:
Breaks secret codes much faster using quantum computers.
In this paper, we introduce a novel quantum algorithm for the factorization of composite odd numbers. This work makes two significant contributions. First, we present a new improvement to the classical Fermat method, fourfold reducing the computational complexity of factoring. Second, we reformulate Fermat factorization method as an optimization problem suitable for Quantum Annealers which allowed us to factorize 8,689,739, the biggest number ever factorized using a quantum device to our knowledge.
Similar Papers
Enhancing the Practical Reliability of Shor's Quantum Algorithm via Generalized Period Decomposition: Theory and Large-Scale Empirical Validation
Quantum Physics
Makes quantum computers break codes faster and more reliably.
Implementation of Shor Algorithm: Factoring a 4096-Bit Integer Under Specific Constraints
Cryptography and Security
Breaks large secret codes much faster.
A Summation-Based Algorithm For Integer Factorization
Numerical Analysis
Breaks secret codes by finding number parts.