D-Wave quantum annealers solve problems classical algorithms struggle with
The latest claim of a clear quantum supremacy solves a useful problem.
Right now, quantum computers are small and error-prone compared to where they'll likely be in a few years. Even within those limitations, however, there have been regular claims that the hardware can perform in ways that are impossible to match with classical computation (one of the more recent examples coming just last year). In most cases to date, however, those claims were quickly followed by some tuning and optimization o...
Read more at arstechnica.com