arXiv · 2611.15387
The Quantum Euclid Algorithm and its Application to Factoring
Abstract
We present a quantum implementation of the Euclid algorithm for calculating the Greatest Common Divisor when one of the integers involved is a compound of two odd-valued primes. We discuss a possible application to the quantum factoring problem, for which modular exponentiation is no longer required, and the factors are revealed directly by measurements, although the method does not scale for large numbers in a favourable manner.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Asma Al-Qasimi, Daniel F. V. James. 2026-11-11. The Quantum Euclid Algorithm and its Application to Factoring. https://searcharxiv.com/abs/2611.15387
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.