This notebook explains the quantum processing unit (QPU) programming model used for factoring, and shows how to implement it. The complexity class for classical integer factoring is believed to be ...

Abstract: We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) ...