On 2011-05-27 8:24 PM, Jean-Philippe Aumasson wrote:
"researchers have constructed special examples of optimization problems where quantum annealing reaches the global optimum exponentially faster than classical simulated annealing. But on the other hand, they�ve constructed other examples where quantum annealing is just as slow as classical simulated annealing, both of them getting trapped in local optima!"
What can be said is that the class of problems soluble by a quantum computer is larger than the class of problems soluble by a classical computer.
How much larger is an empirical question. _______________________________________________ cryptography mailing list [email protected] http://lists.randombit.net/mailman/listinfo/cryptography
