Answers are grounded in this paper and cite their sources.
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner 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 Gröbner bases can be used to reduce the degree of Hamiltonians.
No takes yet. Share an insight, caveat, or question.
Dridi et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: