Prime factorization using quantum annealing and computational algebraic geometry (original) (raw)
ADS
Abstract
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 200000, 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.
Publication:
Scientific Reports
Pub Date:
February 2017
DOI:
arXiv:
Bibcode:
Keywords:
- Quantum Physics;
- Computer Science - Cryptography and Security;
- Mathematics - Commutative Algebra;
- Mathematics - Algebraic Geometry;
- E.3;
- G.1.6;
- I.1.2
E-Print:
D-Wave stats added, minor fixes