Prime Factorization Using Quantum Annealing and Algebraic Geometry

By Raouf Dridi & Hedayat Alghassi
Posted on April 20, 2016

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 200 000, 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.

RESEARCH PAPER       arXiv preprint

BACK