Hence why they can solve certain problems - like factorisation and code breaking - enormously faster than traditional things. I'd imagine that there will be quite a few other types of problems where they'll be terrible.
Being studied at Universities of course so I imagine plenty of stuff to read in papers/online. The factorisation algorithm got published a while ago iirc. Must be using simulations I suppose.
Not obviously clear whether or not they'll be very useful for chess
![Smile :)](./images/smilies/icon_smile.gif)