News for hackers. Stuff that matters.
Re:Scott’s Supreme Quantum Supremacy FAQ by rsln-s on Monday September 23, 2019 @08:40PM (#21055344)
Unfortunately, the same complexity considerations do not hold for Ising problems. While many NP-hard problems can be formulated in Ising form, it is often not hard to get a “pretty good” solutions to these problems. DWave and collaborators have spent a decade trying to come up with exactly the same thing as demonstrated here — namely, a problem specifically designed to demonstrate quantum advantage of any sort — and as of now did not succeed.

To answer your question specifically: DWave does not allow the same level of control over qubits.

Re:Scott’s Supreme Quantum Supremacy FAQ by bjornsing on Monday September 23, 2019 @08:57PM (#21055420)
I’m aware of D-wave’s struggles, but my impression was that they had failed at finding a “deterministic” problem where they could show quantum advantage. I’ve never heard a claim that whatever probability distribution the D-wave can sample from a classical computer can also sample from. I’d love to read about it if you have a reference!
Re:Scott’s Supreme Quantum Supremacy FAQ by sanxiyn on Monday September 23, 2019 @09:32PM (#21055598)
My understanding is that it is exactly the case D-wave probability distributions can be sampled classically.