Prime factorization using quantum annealing and computational algebraic geometry
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 20 Apr 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.