A factorisation algorithm in Adiabatic Quantum Computation
Tien D Kieu · Journal of Physics Communications · 2019
The problem of factorising positive integer N into two integer factors x and y is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials or , of each of which the optimal solution is unique with , and x = 1 if and only if N is prime. An algorithm in the context of Adiabatic Quantum Computation is then proposed for the general factorisation problem.