Google’s Quantum Chip Beat the Classical Limit in a Grid Game
A four-qubit game offers a clear illustration of quantum behavior, without proving that ordinary computers have been beaten at everyday work.
Reading tools for text size, copying, printing and your reading list

Google’s Willow processor won a carefully defined mathematical game 98.3% of the time, exceeding the 88.9% ceiling for classical players who cannot communicate during a round. The study, published in Science on November 19, reports results first made public as a preprint in December 2025. The grid game used just four .[1][2]
A puzzle with incompatible demands
Two players receive different instructions: one fills a row of a three-by-three grid, the other a column. Entries are +1 or −1. Rows must multiply to +1; columns to −1. Their answers must agree where the two intersect. Under uniformly random assignments, even the best shared classical strategy succeeds only eight times in nine. Two pairs of qubits let the players do better by following a quantum measurement strategy.[3]
Here is the contradiction in arithmetic: multiplying all three required row totals gives +1, while multiplying all three column totals gives −1. Both calculations would include exactly the same nine entries. A single completed grid cannot satisfy both. The quantum game does not produce that impossible grid; it tests how two partial answers agree.
Google says the tasks exposed subtle errors missed by random-circuit benchmarks, suggesting a useful additional test for improving quantum hardware.[2]
Bigger experiments, different claims
The researchers separately tested a multiplayer parity game with up to 71 qubits, reporting performance above its classical bound. Another task used up to 105 qubits to find a hidden linear function. These are different experiments, not three sizes of the same magic-square game. Crucially, the preprint labels its finite-size classical circuit-depth comparison for the latter task a conjecture.[3]
The theoretical foundation explains why that distinction matters. Sergey Bravyi, David Gosset and Robert König proved that certain hidden-linear-function problems can be solved by quantum circuits whose number of sequential layers stays fixed as problems grow. Classical circuits built from gates taking a bounded number of inputs require increasing depth. Their construction uses local quantum gates on a two-dimensional grid. This is a precise separation between constrained models of computation, not a stopwatch contest between an unrestricted laptop and a laboratory processor.[4]
An advantage under one rulebook should not be read as a victory under every rulebook. The useful question is which resources were restricted and which outcome was measured, rather than simply which machine won.
The newly published paper gives researchers another way to judge how well a chip can coordinate its qubits. It does not show a faster way to solve an everyday computing problem.[5]