Quantum Annealing for Prime Factorization
- Purdue Univ., West Lafayette, IN (United States)
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
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.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
- Grant/Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1524891
- Journal Information:
- Scientific Reports, Journal Name: Scientific Reports Journal Issue: 1 Vol. 8; ISSN 2045-2322
- Publisher:
- Nature Publishing GroupCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Integer factorization using stochastic magnetic tunnel junctions
|
journal | September 2019 |
p-bits for probabilistic spin logic
|
journal | March 2019 |
Similar Records
Prime factorization using quantum variational imaginary time evolution
Inferring the Dynamics of the State Evolution During Quantum Annealing