Quest towards “factoring larger integers with commercial D-Wave quantum annealing machines”

Integer factorization (IFP), also called prime factorization, is an important problem in number theory, cryptography, and quantum computation. Factoring large integers to attack the RSA cryptosystem is intractable for powerful supercomputers, let alone classical computers. In 1994, Shor [1]presented an algorithm that potentially enabled a quantum computer to find prime factors in polynomial time.