Year: 2026
Type: article
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.
Source: EPJ Quantum Technology
Authors: Asma Al-Qasimi, Daniel F. V. James
Institutions: University of Liverpool, University of Toronto
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,190
OpenAlex ID: W7225626293