For problems with up to 128 variables, the adiabatic times for the simulated processor architecture are about 4 and 6 orders (10,000 to 1 million times faster) of magnitude shorter than the two classical solvers’ times. This performance difference shows that, even in the potential absence of a scaling advantage, adiabatic quantum optimization may outperform classical solvers
High performance Quantum Monte Carlo simulations on a large-scale Internet-based computing platform were used to compare the median adiabatic times with the median running times of two classical solvers .
10 page paper - Investigating the Performance of an Adiabatic Quantum Optimization Processor
If you liked this article, please give it a quick review on Reddit, or StumbleUpon. Thanks
How to Make Money