IBM and several research partners said on July 30 that they had demonstrated quantum advantage in three experiments. That term describes a calculation a quantum computer can perform more accurately, cheaply or efficiently than the best available classical method.

The announcement sounds like the end of a long race. It is better understood as the start of a new round of checking.

Quantum advantage claims have a built-in problem. A result becomes interesting when a conventional supercomputer can no longer reproduce it. At that point, the usual way of verifying the quantum machine has also disappeared. Earlier advantage demonstrations have sometimes lost ground when classical researchers found faster simulation methods.

IBM’s new argument is that trust can be built into the experiment rather than supplied afterward by a classical answer.

The most mathematically structured experiment came from IBM and the University of Chicago. The researchers began with quantum circuits that a classical computer can still simulate, then made them progressively harder by adding operations called T gates. They embedded the circuit in a form of error-detecting code, allowing the system to estimate how faithfully the hard computation ran.

The team used 97 physical qubits to encode a 70-logical-qubit circuit. A logical qubit is protected by information spread across physical qubits. The experiment included 2,415 logical two-qubit operations and 468 T gates. IBM says its processor finished in about 15 minutes while leading classical approaches faced impractical runtimes.

A second experiment led by Qedma studied Floquet dynamics, the behavior of an interacting quantum system under repeated pulses. Researchers ran circuits with as many as 74 qubits and compared the results with two advanced simulations on Japan’s Fugaku supercomputer. The classical methods eventually disagreed with each other, while the quantum results remained consistent across different error-mitigation techniques and partial repetitions on Quantinuum hardware.

The third paper, led by Algorithmiq, examined how information moves through a model of irregular quantum matter. Instead of assuming one noise level, the researchers deliberately varied noise, calibration and IBM processors. The result stayed stable while leading classical methods gave conflicting predictions. Algorithmiq also released its strongest classical method so other groups can challenge the claim.

The genuinely new element is not simply that a quantum processor completed a difficult calculation. It is the effort to establish a chain of evidence when an exact classical answer is unavailable.

The University of Chicago method provides a statistical lower bound on the computation’s fidelity. The other studies look for agreement across independent error-mitigation methods, hardware runs and controlled changes to noise. These checks do not make the machines error-free. They make the uncertainty more measurable.

The papers and data are also being placed on IBM’s Quantum Advantage Tracker. That matters because quantum advantage is not a permanent certificate. A claim holds only while no classical method can match it under a fair comparison. Better algorithms or more efficient supercomputer implementations can move that boundary.

The three papers were posted as preprints and had not completed peer review when IBM announced them. IBM supplied the hardware and collaborated on all three, so outside replication remains important. Independent reports from The Wall Street Journal and Live Science confirm the scope of the announcement, but they do not replace technical review.

The demonstrations also do not mean ordinary companies suddenly have a faster way to run databases, train AI models or optimize delivery routes. Two experiments focus on research models of quantum systems. The Chicago work is a deliberately constructed sampling problem. These are scientifically useful test beds, not commercial workloads.

There is still a practical consequence. Researchers now have stronger techniques for asking whether a noisy quantum computer produced a trustworthy result after classical verification became too expensive. That is necessary before quantum machines can become credible tools for materials science, chemistry and other fields built around hard quantum simulations.

The useful angle is therefore not whether IBM has won a race. It is whether the open challenge survives. Watch for peer review, reproduction on unrelated hardware and new classical attacks on the published benchmarks. If the results endure, the milestone will be less about raw quantum speed than about knowing when to believe the machine.

IBM Research overview, University of Chicago and IBM preprint, Algorithmiq-led preprint, University of Chicago explanation, The Wall Street Journal, and Live Science.