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:1505.04577 · Quantum Information Processing

Analogue algorithm for parallel factorization of an exponential number of large integers: I. Theoretical description

Vincenzo Tamma

Published Nov 23, 2015• 10 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1190-y

Related papers

Analogue algorithm for parallel factorization of an exponential number of large integers: II—optical implementation

Vincenzo Tamma

arXiv:1505.04584•Quantum Information Processing•Nov 26, 2015•12 citations

Quantum computing based on optical interference: from analogue to digital novel implementations

Vincenzo Tamma

In a recent experiment, we have shown how optical interference can be exploited in order to perform computations and in particular factoring large integers. This has lead us to the developing of a novel analogue algorithm which allows the factorization of several large integers in a single run. This work represents a step stone towards the developing of novel physical networks able to implement quantum digital algorithms other than Shor’s algorithm. We describe the main ideas leading to this new line of research referring to future publications for a detailed description.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 15, 2012•0 citations

Progress in the prime factorization of large numbers

Dan Zhang, Hui Wang, Shuang Li +1 more

The Journal of Supercomputing•Jan 25, 2024•11 citations

Quantum Algorithms for Integer Factorization

Song Yuan Yan

Springer eBooks•Jan 1, 2015•0 citations

Performance Analysis of Shor's Algorithm for Integer Factorization Using Quantum and Classical Approaches

T. Thamaraimanalan, Bhupendra Singh, M. Mohankumar +1 more

Factoring large numbers poses a significant chal-lenge in contemporary cryptography and security practices. Shor's algorithm presents a remarkable advancement over clas- sical methods by providing exponential acceleration in factoring large numbers, presenting a possible risk to traditional cryptography methods. The algorithm relies on the Quantum Fourier Transform (QFT) and modular exponentiation principles to efficiently ascertain the period (x) of a given large number (N). Upon determining the period using classical methods, the prime factors of the large number can be easily computed. To eval- uate the algorithm's efficiency and scalability, both simulation- based experiments and theoretical analyses are conducted. The algorithm is simulated utilizing the Qiskit back end to estimate resources, including Clifford gates, T gates, T depth, Full depth, and qubits, across a range of large numbers.

International Conference on Advanced Computing and Communication Systems (ICACCS)•Mar 14, 2024•11 citations

Classical and Quantum Algorithms for Exponential Congruences

Wim van Dam, Igor E. Shparlinski

arXiv:0804.1109•Lecture notes in computer science•Jan 1, 2008•28 citations
In a recent experiment, we have shown how optical interference can be exploited in order to perform computations and in particular factoring large integers. This has lead us to the developing of a novel analogue algorithm which allows the factorization of several large integers in a single run. This work represents a step stone towards the developing of novel physical networks able to implement quantum digital algorithms other than Shor’s algorithm. We describe the main ideas leading to this new line of research referring to future publications for a detailed description.
Factoring large numbers poses a significant chal-lenge in contemporary cryptography and security practices. Shor's algorithm presents a remarkable advancement over clas- sical methods by providing exponential acceleration in factoring large numbers, presenting a possible risk to traditional cryptography methods. The algorithm relies on the Quantum Fourier Transform (QFT) and modular exponentiation principles to efficiently ascertain the period (x) of a given large number (N). Upon determining the period using classical methods, the prime factors of the large number can be easily computed. To eval- uate the algorithm's efficiency and scalability, both simulation- based experiments and theoretical analyses are conducted. The algorithm is simulated utilizing the Qiskit back end to estimate resources, including Clifford gates, T gates, T depth, Full depth, and qubits, across a range of large numbers.