A team of researchers from Q-CTRL and IBM says it has achieved a 3,000-fold wall-clock speedup over the best available classical methods while simulating a foundational physics model on a 120-qubit quantum processor. The result, posted as a preprint on arXiv in June 2026, targets the one-dimensional Fermi-Hubbard model, a mathematical framework that describes how electrons hop between sites on a lattice and interact with each other. If the speedup withstands independent scrutiny, it would mark the strongest demonstration yet this year that quantum hardware can outperform classical computers on a problem scientists actually need to solve.
That last qualifier matters. Previous quantum advantage claims, most notably Google’s 2019 random circuit sampling experiment, targeted tasks designed to be hard for classical machines but lacking direct scientific applications. The Fermi-Hubbard model is different. It underpins research into magnetic ordering, exotic electron behavior, and the physics behind high-temperature superconductors, materials that could transform energy transmission if engineers can learn to build them reliably. Simulating this model at scale is one of the problems quantum computers were always supposed to be good for. Now Q-CTRL and IBM are claiming they have shown it in practice.
What the experiment actually did
The team encoded a one-dimensional Fermi-Hubbard chain of up to 60 lattice sites onto 120 qubits of an IBM quantum processor. Each site requires two qubits (one for spin-up electrons, one for spin-down), so the mapping is direct but demands careful handling of the processor’s limited qubit connectivity.
To simulate how the system evolves over time, the researchers used Trotterization, a standard technique that breaks continuous quantum dynamics into a sequence of discrete gate operations. For the 120-qubit system, they ran 30 Trotter steps, evolving the simulation out to a time parameter of t=6. A smaller 62-qubit configuration (31 lattice sites) was pushed further to 90 Trotter steps, allowing the team to probe longer time horizons and cross-check their quantum results against classical calculations.
Those step counts are significant. A shallow quantum circuit with only a handful of operations would be easy for a classical computer to replicate. Pushing to 30 and 90 steps at these qubit counts is what forces classical methods into expensive territory and makes the speedup comparison meaningful.
Q-CTRL, an Australian-founded company specializing in quantum control infrastructure, contributed the error-suppression layers that made the deep circuits feasible. Their software optimizes control pulses and gate sequencing to squeeze maximum fidelity out of noisy hardware. IBM provided the processor itself. The two companies have collaborated before, but this is the first time their joint work has produced a speedup claim of this scale on a condensed-matter physics workload.
The classical baseline and why it matters
A speedup claim is only as strong as the classical method it is measured against. Here, the reference point is a tensor-network algorithm based on the time-dependent variational principle (TDVP) with controlled bond expansion for matrix product states, described in a separate methodological paper. For one-dimensional quantum systems, tensor-network methods are among the most powerful classical tools available. They exploit the relatively limited entanglement structure of 1D chains to compress the problem into a tractable form.
The 3,000x figure represents the ratio of wall-clock runtimes: how long the classical algorithm took on conventional hardware versus how long the quantum processor took to produce results of comparable accuracy. That comparison invites immediate questions. Tensor-network performance depends heavily on tunable parameters like bond dimension, time-step size, and convergence thresholds. Adjusting any of these can shift classical runtimes by orders of magnitude. Whether the Q-CTRL and IBM team selected the most competitive classical configuration, or whether a different setup would narrow the gap, is something independent benchmarking will need to resolve.
Classical computing researchers will likely probe several angles: whether adaptive time stepping could reduce the classical cost, whether alternative truncation schemes perform better at these system sizes, and whether running the tensor-network code on GPU-accelerated hardware (rather than standard CPUs) changes the picture. History suggests they will try. After Google’s 2019 experiment, IBM’s own classical simulation team demonstrated that improved classical algorithms could narrow the claimed advantage significantly.
What has not been verified
The 3,000x speedup has not appeared in a peer-reviewed journal. No independent group has publicly reproduced the experiment or re-run the classical baseline with identical parameters. Raw runtime logs and detailed processor calibration data have not been deposited in a public repository, which limits outside verification of the wall-clock comparison.
The experiment also operates without full fault-tolerant error correction. Q-CTRL’s approach relies on software-level techniques: optimized pulse shaping, dynamical decoupling, and careful circuit compilation. These methods reduce noise but do not eliminate it, and errors accumulate as circuit depth increases. The reported agreement between quantum and classical results over the simulated time window is encouraging, but it remains unclear how robust that agreement would be under different calibration conditions, on a different day’s hardware performance, or on a competing processor architecture.
Neither Q-CTRL nor IBM has publicly outlined how this laboratory result might translate into a commercial product or deployment timeline. Quantum processors still contend with high error rates, limited connectivity, and calibration drift, all of which can erode performance gains when moving from a carefully tuned demonstration to routine use.
How this fits into the larger race
Context from IBM’s own recent history is useful here. In 2023, the company published a utility-scale experiment using its 127-qubit Eagle processor, showing that quantum circuits with error mitigation could produce accurate expectation values for an Ising model beyond the reach of brute-force classical simulation. That result sparked debate about whether it constituted genuine quantum advantage or simply demonstrated that quantum hardware could match classical results on a specific problem. The new Q-CTRL/IBM experiment goes further by targeting a more physically relevant model and claiming a concrete, quantified speedup rather than a qualitative comparison.
The distinction between the 1D and 2D Fermi-Hubbard model also deserves attention. One-dimensional chains, while nontrivial, are the regime where classical tensor-network methods perform best. The real computational bottleneck in condensed-matter physics lies in two-dimensional systems, where entanglement grows much faster and classical methods struggle far more severely. If the techniques demonstrated here can be extended to 2D Fermi-Hubbard simulations, the case for near-term quantum utility in materials science would strengthen considerably. That extension, however, will require both more qubits and substantially deeper circuits, pushing further into territory where noise management becomes even more critical.
What to watch for next
The result is best understood as a strong candidate for problem-specific quantum advantage, not a settled verdict. Several developments in the coming months will determine whether it holds up.
First, independent replication. Other research groups with access to IBM’s cloud-based quantum processors or competing hardware will likely attempt to reproduce the key circuits and verify the accuracy of the quantum outputs. Second, classical counter-attacks. Tensor-network specialists will test whether optimized implementations, GPU acceleration, or alternative algorithms can close the 3,000x gap. Third, peer review. The arXiv preprint will need to survive formal evaluation, where reviewers can probe the experimental methodology, error analysis, and fairness of the classical comparison in detail.
For researchers tracking whether quantum computers are crossing the threshold from laboratory curiosities to practical scientific tools, this is the result to watch. It demonstrates that carefully engineered quantum hardware, paired with sophisticated control software, can tackle a meaningful many-body physics problem at a scale that strains the best classical techniques. Whether that advantage proves durable will depend on how the broader community responds, by stress-testing the algorithms, challenging the baselines, and pushing similar approaches onto harder problems and different platforms.
More from Morning Overview
*This article was researched with the help of AI, with human editors creating the final content.
