Scientific Reports · 2018 · 178 citations · 28 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationQuantum ComputingNumber-theoretic AlgorithmsQuantum AlgorithmsQuantum AnnealingQuantum BitsQuantum ComputationAnnealingEfficient Resource UseInteger FactorizationIsing ModelLogical QubitsQuantum Circuit Optimization
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 [Formula: see text] 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.
28
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann et al. · Science · 2001 · 2.1K citations · Full text
Computing, Computer Science, Physics +15
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Lieven M. K. Vandersypen, Matthias Steffen, Gregory Breyta et al. · Nature · 2001 · 1.7K citations · Full text
Computing, Computer Science, Physics +15
Tameem Albash, Daniel A. Lidar · Reviews of Modern Physics · 2018 · 1.6K citations · Full text
Computing, Computer Science, Physics +14