3 ms·
From the article: > D-Wave’s quantum system runs a quantum annealing algorithm to find the lowest points in a virtual energy landscape representing a computati
by mastazi 10y ago
From the article:
> D-Wave’s quantum system runs a quantum annealing algorithm to find the lowest points in a virtual energy landscape representing a computational problem to be solved.
In statistics and machine learning, this is great for finding optima in cost functions.
The ideas in this paper are related: https://arxiv.org/abs/1412.3489v2 https://arxiv.org/abs/1412.3489v2
- AstralStorm 10y agoBy great you mean "slower than same known algorithm implemented in modern hardware", yes? Simulated annealing they do is not even the best algorithm to search nonlinear solution spaces.
- mastazi 10y agoYou are right, what I actually meant is "great once quantum computing becomes a commercially viable route" :-) Regarding the second line of your comment: I don't have comprehensive knowledge about the possible alternatives, could you direct me towards some sources?
- acqq 10y agoDiscussed in 2015: http://news.mit.edu/2015/3q-scott-aaronson-google-quantum-computing-paper-1211 http://news.mit.edu/2015/3q-scott-aaronson-google-quantum-co... "In the current model of the D-Wave chip, there are 1,000 or so qubits [quantum bits], but they’re organized into clusters of eight qubits each." "what the Google paper finds is that Selby’s algorithm, which runs on a classical computer, totally outperforms the D-Wave machine on all the instances they tested." Now they've just made a machine of twice as much qubits but is there any performance advantage compared to the code run on the classical computer?
- mastazi 10y agoThanks for the link + explanation! Now that I saw the article, I vaguely remember the story but, at the time, I did not do any further reading.