Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid-crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.
No takes yet. Share an insight, caveat, or question.
Xu et al. (2012) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: