A Quantum Computer Just Solved a Problem Three Million Times Faster than a Classical Computer
upstart writes in with an IRC submission:
Scientists from quantum computing company D-Wave have demonstrated that, using a method called quantum annealing, they could simulate some materials up to three million times faster than it would take with corresponding classical methods.
Together with researchers from Google, the scientists set out to measure the speed of simulation in one of D-Wave's quantum annealing processors, and found that performance increased with both simulation size and problem difficulty, to reach a million-fold speedup over what could be achieved with a classical CPU.
The calculation that D-Wave and Google's teams tackled is a real-world problem; in fact, it has already been resolved by the 2016 winners of the Nobel Prize in Physics, Vadim Berezinskii, J. Michael Kosterlitz and David Thouless, who studied the behavior of so-called "exotic magnetism", which occurs in quantum magnetic systems.
[...] In contrast, D-Wave's latest experiment resolved a meaningful problem that scientists are interested in independent of quantum computing. The findings have already attracted the attention of scientists around the world.
Journal Reference:
Andrew D. King, Jack Raymond, Trevor Lanting, et al. Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets [open], Nature Communications (DOI: 10.1038/s41467-021-20901-5)
Read more of this story at SoylentNews.