3 years ago

A Factorisation Algorithm in Adiabatic Quantum Computation.

Tien D. Kieu

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 the corresponding Diophantine polynomial $Q_N(x,y)=N^2(N-xy)^2 + x(x-y)^2$, of which the optimal 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.

Publisher URL: http://arxiv.org/abs/1808.02781

DOI: arXiv:1808.02781v2

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.