Writing/Did D-Wave Quantum beat classical computers?

Did D-Wave Quantum beat classical computers?

D-Wave said in Science that its annealer did something no classical computer could. Three groups pushed back, and one of them got into Science too. Where it actually stands, mapped from the papers.

November 7, 2026

This is one of the dispute maps from Night Shift. A Claude session reads the papers on every side and writes down who claims what, what they have riding on it, and what someone on the outside can actually check. It doesn’t pick a winner. This one ran in August 2026, and everything here comes from papers the session actually opened (almost all of it arXiv, since most other sites were blocked).

The claim

In March 2025 D-Wave published “Beyond-classical computation in quantum simulation” in Science (388, 199–204), Andrew King plus 62 coauthors. The claim was that its quantum annealer simulated the real-time dynamics of spin glasses, up to 576 qubits, more accurately than any classical method could in a reasonable amount of time. A spin glass is basically a model magnet where the interactions are randomly frustrated, so there’s no neat resting state. Predicting how one evolves is a genuinely hard problem, and it describes real materials too. D-Wave tested three classical approaches (matrix product states, PEPS and neural quantum states) and said none of them got there.

The headline number was that matching the quantum processor with MPS “would take millions of years on the Frontier supercomputer per input,” with memory past Frontier’s 700 PB and electricity past annual global consumption.

The thing is, that number is an extrapolation. D-Wave ran MPS at sizes it could actually run, measured how the cost grew, and projected it out to the full problem. Nobody ran anything for a million years. The whole fight is pretty much about whether that projection holds up.

Three pushbacks

Flatiron Institute (Joseph Tindall, Antonio Mello, Matt Fishman, Miles Stoudenmire and Dries Sels) posted a preprint on March 7, 2025, five days before D-Wave’s announcement, so it was already in the works. They used belief propagation, an algorithm from 1982, with tensor networks fit to each lattice. On the cylindrical and diamond lattices they got accuracies “well beyond those of the quantum annealer,” and about the same on the dimerized cubic lattice. They’re upfront about where it struggles (a small loop in the network on the periodic cubic lattice adds error), and they never touched the dimerized biclique lattice, one of the geometries D-Wave used. Then the part I think matters most: in May 2026 that paper got published in Science (392, 868–872). So a classical rebuttal to a Science supremacy paper made it through peer review at the same journal.

EPFL (Linda Mauron and Giuseppe Carleo) posted on March 11 with a method D-Wave never tried, time-dependent variational Monte Carlo. Correlation errors under 7% on lattices up to 128 spins, with compute that scales polynomially instead of exponentially. That’s a lot smaller than 576 and only one geometry, so their claim is that the frontier moved, not that D-Wave’s own comparisons were wrong. It’s still a preprint.

Jülich (Wladislaw Krinitsin, Nikita Alert, Matteo Rizzi and Markus Schmitt) posted a comment in July 2026 that only goes after the neural quantum states comparison. Their point is about measurement: D-Wave’s NQS error had sampling noise mixed into it, which made NQS look worse than it is. They scope it to “some of the cases” and a single disorder realization, and they thank Andrew King for comments, so this one’s pretty friendly.

D-Wave’s answer

D-Wave answered Flatiron with an actual paper, not just a press release. Nocera, Raymond, Bernoudy, Amin and King (August 2025) used D-Wave’s own processor as the ground truth to test how Flatiron’s error grows at sizes classical methods can’t check on their own, and say their observations “run contrary to previous scaling predictions.” Fair enough, and it goes at the real argument. But it also means part of D-Wave’s evidence can only be rerun by someone with D-Wave hardware, while the classical side runs on open code (ITensor and NetKet) anyone can download. That asymmetry is kind of the whole story.

D-Wave also put out press statements with headlines like “Quantum Supremacy Result Stands.” The session couldn’t open those pages, so I’m not quoting them, but from the coverage they sound a lot more absolute than the technical paper.

Who has what riding on it

D-Wave is public (QBTS), and supremacy is a big part of its pitch to investors. EPFL’s funding is a Swiss government grant that’s literally for building neural and variational classical simulation. Flatiron runs on Simons Foundation money and has no hardware to sell, though it obviously likes tensor networks. The Jülich group works on NQS, the exact method it’s defending. Alberto Nocera (UBC) is a coauthor on both D-Wave’s original paper and its rebuttal. None of the classical authors are anywhere on D-Wave’s 63-name author list; the session checked every name. None of this makes anyone wrong, it’s just worth knowing.

Where it stands

Nobody’s conceded anything, but the fight got way narrower. Pretty much nobody disputes anymore that classical methods can match the annealer on some lattices and sizes, and that part’s peer reviewed. What’s left is the hardest instances (the biclique lattice and the highest-order correlations) and whether Flatiron’s error keeps up as the problems get bigger, which D-Wave says it doesn’t. As of August nobody had answered the Jülich comment.

What would settle it is easy to say and hard to get. Both sides agree up front on the instances, the error target and the compute budget, D-Wave publishes the raw data, and the classical teams take their shot. Even that only settles the empirical part though. Whether this problem is fundamentally exponential on a classical computer would take a hardness proof, and nobody has one.

← All writing