Prime factorization using quantum annealing and computational algebraic geometry

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Grobner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Grobner bases can be used to reduce the degree of Hamiltonians.