Quantum computers have achieved a milestone that classical machines can never match. Researchers demonstrated a quantum system performing a task that is mathematically impossible for any classical computer to replicate, according to a paper published in Nature Communications.
The test centers on a game where a quantum computer is shown a secret list for an instant and then asked to name something that wasn't on it. Over hundreds of rounds, the quantum system got the answer right most of the time. Crucially, there is a mathematically proven limit to how well any classical computer can perform this specific task. The experiment was conducted on Quantinuum's System Model H2 trapped-ion quantum computer with 55 qubits. The paper, titled "Unconditional and exponentially large violation of classicality," demonstrates that the quantum system can violate classical physics in a way that is both unconditional and exponentially large.
Unlike previous quantum supremacy claims that relied on unproven complexity theory assumptions, this test provides a clean, verifiable demonstration of quantum advantage. The trajectory toward practical quantum advantage has been accelerating, with error-corrected quantum computing now crossing a threshold that signals a clear path forward. D-Wave has already demonstrated quantum supremacy on a useful real-world problem, where its annealing quantum computer solved a complex material simulation in minutes that would take a supercomputer nearly a million years. Google's quantum algorithm has also achieved a breakthrough, running 13,000 times faster than the best classical algorithm on a supercomputer.