# Prime factorization using quantum annealing and computational algebraic geometry

arXiv: https://arxiv.org/abs/1604.05796 · HTML: https://mlsanity.com/paper/1604.05796/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Apr 2016.

## Built on by (most cited first, 1 of 1)

- [Hard instance learning for quantum adiabatic prime factorization](https://mlsanity.com/paper/2110.04782/) (2021)

## 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.