On 28/05/11 03:37, James A. Donald wrote: > 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.
No, it can't: - for idealized quantum and classical computers (with unbounded memory running for unbounded time), those classes are identical. - for quantum and classical computers that can be practically built at any point in time, and with a limit on the time to find a solution, it certainly isn't clear that the class of problems soluble by quantum computers will be larger (ever). That depends on how big and fast you can make quantum computers and classical computers. -- David-Sarah Hopwood ⚥ http://davidsarah.livejournal.com
signature.asc
Description: OpenPGP digital signature
_______________________________________________ cryptography mailing list cryptography@randombit.net http://lists.randombit.net/mailman/listinfo/cryptography
