A Factorisation Algorithm in Adiabatic Quantum Computation

Tien D. Kieu

Published 2018-08-08Version 1

The problem of factorising an positive integer $N$ into two integer factors $x$ and $y$ is first reformulated as an optimisation problem over the positive integer domain of the corresponding Diophantine polynomial $Q_N(x,y)=N^2(N-xy)^2 + x(x-y)^2$, of which the solution is unique with $x\le \sqrt{N} \le y$, 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.