The quantum Euclid algorithm and its application to factoring
Related Experiment Videos
Asma Al-Qasimi1, Daniel F V James2
1Department of Electrical Engineering and Electronics, University of Liverpool, Liverpool, L69 3BX United Kingdom.
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.
Related Concept Videos
Factoring Polynomials
Factoring Second Degree Polynomials
Factoring Polynomials by Grouping
Fundamental Theorem of Algebra
Partial Fractions
Perfect Square Trinomial: Square of a Difference