💻 Classical Computers Just Overturned a Major Quantum Advantage Claim

In 2025, researchers used D-Wave’s Advantage2 quantum annealer to simulate the dynamics of hundreds of interacting qubits — and argued that the task was beyond the reach of classical computers.

A team from the Flatiron Institute and Boston University has now reproduced those results using classical algorithms and relatively modest hardware. Some of the initial calculations even ran on a personal laptop.

The challenge involved quantum spin glasses: disordered systems in which hundreds of interacting qubits evolve across two- and three-dimensional lattices. Tracking the complete quantum wave function directly would require an amount of memory that grows exponentially with the number of qubits.

The researchers avoided that explosion using tensor networks — mathematical structures that compress a quantum state by retaining its most important correlations.

Think of it as a highly specialized zip file for quantum information.

They combined tensor networks with belief propagation, an algorithm developed in the 1980s and recently adapted for quantum systems. The calculations were implemented using ITensor, a high-performance tensor-network software library.

The classical simulations:

• reproduced the quantum computer’s results
• matched theoretical predictions and exact benchmarks
• scaled to systems containing hundreds of qubits
• captured quantum dynamics in complex 3D lattice geometries

There is one important caveat: the entire study was not completed on an ordinary laptop. A laptop was sufficient for some early calculations, while the largest simulations required more powerful conventional processors and GPUs.

Still, the result directly challenges the earlier claim that this particular problem was beyond classical computation.

It does not mean quantum computers are useless. It means that demonstrating genuine quantum advantage requires beating the best classical algorithms available — not merely the best ones researchers happened to test previously.

The boundary between classical and quantum computing is not fixed. Every improvement in quantum hardware gives classical researchers a new target, while every better classical algorithm raises the bar for quantum advantage.

Sometimes the strongest competitor to a quantum computer is not another quantum computer.

It is better mathematics.

📄 Paper: Dynamics of disordered quantum systems with two- and three-dimensional tensor networks
https://www.science.org/doi/10.1126/science.adx2728

#QuantumComputing #Physics #TensorNetworks #ClassicalComputing #QuantumPhysics

🧠 An Ordinary Laptop Just Solved a Quantum Problem That Challenged a Quantum Computer

Last year, researchers using D-Wave’s quantum annealer argued that a particularly difficult quantum simulation was beyond the reach of classical computers.

Now physicists at the Flatiron Institute have shown otherwise.

Using tensor networks together with belief propagation—an algorithm first developed in the 1980s—they reproduced the same results using classical hardware, with some of the calculations running on a personal laptop.

The challenge involved simulating hundreds of interacting qubits arranged in complex 2D and 3D lattices. Instead of storing the impossibly large quantum wave function directly, the researchers compressed it into a far more efficient mathematical representation.

The work doesn’t diminish quantum computing. Instead, it raises the bar for what counts as quantum advantage. Every breakthrough in classical algorithms forces quantum hardware to tackle even harder problems—and advances in quantum computing continue to inspire smarter classical methods in return.

Paper (Science): https://www.science.org/doi/10.1126/science.adx2728

#QuantumComputing #Physics #TensorNetworks #Science