Prime factorization using quantum annealing and computational algebraic geometry
classification
🪐 quant-ph
cs.CRmath.ACmath.AG
keywords
factorizationquantumalgebraicannealingcomputationalgeometryprimealgorithm
read the original 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 $200 \, 000$, the largest number factored to date using a quantum processor.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.