Quantum Annealing for Prime Factorization

Shuxian Jiang, Keith A. Britt, Alexander J. McCaskey, Travis S. Humble, Sabre Kais

Research output: Contribution to journalArticlepeer-review

100 Scopus citations

Abstract

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses O(log2(N)) binary variables (qubits) for finding the factors of an integer N. We present how to factorize 15, 143, 59989, and 376289 using 4, 12, 59, and 94 logical qubits, respectively. This method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. The method is general and could be used to factor larger integers as the number of available qubits increases, or combined with other ad hoc methods to achieve better performances for specific numbers.

Original languageEnglish
Article number17667
JournalScientific Reports
Volume8
Issue number1
DOIs
StatePublished - Dec 1 2018

Fingerprint

Dive into the research topics of 'Quantum Annealing for Prime Factorization'. Together they form a unique fingerprint.

Cite this