Prime factorization using quantum annealing and computational algebraic geometry
This addresses the problem of integer factorization for cryptography and quantum computing, representing a significant advance in quantum computational capabilities.
The paper tackled prime factorization by combining quantum annealing with computational algebraic geometry, resulting in a scalable algorithm that factored all bi-primes up to just over 200,000, the largest number factored using a quantum processor to date.
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over $200 \, 000$, the largest number factored to date using a quantum processor.