Quantum Algorithm finds factors directly from two prime numbers

Calculating the factors of large numbers is computationally demanding, often requiring extensive trial divisions, potentially up to approximately thirteen billion times for a one hundred-digit number using conventional methods. A team from the University of Liverpool and University of Toronto explored an alternative approach by implementing Euclid’s algorithm on a quantum computer to find the greatest common divisor, revealing prime factors directly through measurement.

This approach aimed to reveal prime factors directly through measurement without needing complex calculations like modular exponentiation used in Shor’s algorithm; however, this implementation does not scale efficiently as numbers grow larger, its demands increase too rapidly to be practical. This ancient method efficiently finds the greatest common divisor (GCD), essentially repeatedly subtracting the smaller number from the larger until nothing remains, with the aim of revealing prime factors directly through measurement without needing complex calculations like modular exponentiation; this is akin to how clock arithmetic “wraps around” once values reach the maximum hour.

However, initial findings suggest that this approach doesn’t scale well for large numbers as its computational demands increase too rapidly to be practical. Researchers are now exploring whether parallel processing could overcome these limitations and offer a viable path towards faster quantum factoring.

Quantum Euclid’s Algorithm shows initial equivalence to classical methods for GCD calculation

A quantum implementation of Euclid’s Algorithm initially required approximately 3.25 × 10¹³ trial divisions, equivalent to conventional methods for a 100-bit number. It aimed to bypass computationally intensive steps like modular exponentiation found in Shor’s algorithm by revealing factors through direct measurement outcomes. This method explores calculating the Greatest Common Divisor (GCD), seeking an alternative route to factoring that doesn’t rely on period analysis; however, it currently lacks favourable scaling characteristics compared with existing techniques.

Determining the period ‘r, essential for factoring within Shor’s algorithm, conventionally demands evaluating a specific function around 2.5 × 10²⁹ times for a 100-bit number, an undertaking requiring roughly 8.0×10¹⁵ years on a single processor. Out of every 756 potential values of ‘C’, when attempting to factor the composite number 889 (7x 127), up to 372 attempts resulted in either an odd value for ‘r’ or yielded trivial factors of one and itself; this represents nearly half failing to produce useful results. Numerical experiments also suggest that approximately 20% of cases will yield an odd period if ‘C is not a perfect square, independent of the size of the factored number.

Quantum Euclid’s Algorithm explores novel factorization despite scalability limits

The University of Toronto and University of Liverpool team’s work offers an intriguing alternative to established methods like Shor’s Algorithm, which relies on complex modular exponentiation. However, its implementation doesn’t scale favorably as number size increases, effectively limiting usefulness for real-world cryptographic applications requiring extremely large integers. Still, this investigation presents valuable insight by offering a different approach to factoring, a core challenge in modern cryptography, and bypassing complex modular exponentiation altogether, even with acknowledged scaling issues.

When one integer involved is a compound of two odd primes, the method uses a quantum version of Euclid’s algorithm revealing potential factors directly through measurement. A University of Toronto and University of Liverpool team calculated the Greatest Common Divisor using a quantum computer; it offers possible application to factoring without needing modular exponentiation, though the approach does not scale favorably for large numbers. Initial tests showed comparable computational effort to conventional methods, but further investigation is needed as researchers seek encryption methods that might allow genuinely new avenues in encryption design.

This research demonstrated a quantum implementation of Euclid’s algorithm for finding the Greatest Common Divisor when one integer is composed of two odd primes. The method reveals potential factors through direct measurements, offering an alternative to traditional factorization techniques which require approximately 2.5 × 10²⁹ function evaluations for a 100-bit number. While initial experiments with the composite number 889 indicated nearly half of attempts did not yield useful results, and scaling remains unfavorable for large numbers, this work provides insight into factoring approaches that bypass modular exponentiation.

More like this

Quantum AlgorithmsQuasiperiodic systems may gain a unified theory with new ‘ergodicity’ insights

Quantum AlgorithmsQuantum algorithms improve efficiency for complex Boolean function calculations

High Performance ComputingPower grid problem tests Quantum Inspire’s link to DelftBlue

Quantum AlgorithmsQuantum Algorithm estimates Eigenvalues faster than classical methods for Sparse Matrices