News for hackers. Stuff that matters.
Re:Scott’s Supreme Quantum Supremacy FAQ by sanxiyn on Monday September 23, 2019 @09:17PM (#21055514)
In principle, there is no reason why D-wave also can't achieve quantum supremacy. It is just that D-wave hasn't, so far.

As for Ising model, D-wave didn't outperform classical algorithm after classical algorithm was tuned (it was a new problem, so existing classical algorithm wasn't the best possible), see https://arxiv.org/abs/1401.1084, also there are reasons to suspect why Ising model will not provide any quantum speedup, see https://arxiv.org/abs/1411.5693.

Re:Scott’s Supreme Quantum Supremacy FAQ by bjornsing on Monday September 23, 2019 @09:20PM (#21055535)
Well D-wave is evaluated on an optimization task. This Google thing isn’t even trying to solve a real problem. What says you can’t get some very hard to replicate random bits out of a D-wave?
Re:Scott’s Supreme Quantum Supremacy FAQ by jessriedel on Monday September 23, 2019 @10:12PM (#21055823)
If D-Wave could achieve quantum supremacy, they definitely would, and would heavily publicize it. They haven't, which gives us strong evidence that they can't right now.
Re:Scott’s Supreme Quantum Supremacy FAQ by sanxiyn on Monday September 23, 2019 @09:25PM (#21055556)
Do you retract the claim Ising model problems are "extremely difficult" for classical computers? I replied with practical and theoretical considerations why it is not so.
Re:Scott’s Supreme Quantum Supremacy FAQ by bjornsing on Monday September 23, 2019 @09:55PM (#21055734)
I made no claim at all, I just stated an assumption that motivated my question. But you also misrepresent my assumption. My assumption was that the D-wave could sample from the solutions to “ising model-like problems” much more efficiently than a classical computer. A quick glance at your references gave me the impression they where about finding a single ground state / global minima of the hamiltonian. That’s a very different problem.