Work

A factorisation algorithm in Adiabatic Quantum Computation

Year: 2019

Type: article

Abstract: 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.

Source: Journal of Physics Communications

DOI: 10.1088/2399-6528/ab060d

Author: Tien D Kieu

Institution: Swinburne University of Technology

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,495

Funder: Swinburne University of Technology