Prime factorization using quantum annealing and computational algebraic geometry
From MaRDI portal
Abstract: We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr"obner 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 , the largest number factored to date using a quantum processor.
This page was built for publication: Prime factorization using quantum annealing and computational algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6272726)
