An integer factorization algorithm which uses diffusion as a computational engine. (arXiv:2104.11616v2 [quant-ph] UPDATED)

In this article we develop an algorithm which computes a divisor of an
integer $N$, which is assumed to be neither prime nor the power of a prime. The
algorithm uses discrete time heat diffusion on a finite graph. If $N$ has $m$
distinct prime factors, then the probability that our algorithm runs
successfully is at least $p(m) = 1-(m+1)/2^{m}$. We compute the computational
complexity of the algorithm in terms of classical, or digital, steps and in
terms of diffusion …

algorithm article complexity computational compute engine heat integer power prime