Quantum Computing
Google Quantum AI Demonstrates Contextuality Across 105 Qubits

Key PointsGoogle's magic-square game won 98.3% of the time against an 88.9% classical limit.
View more
- Google's magic-square game won 98.3% of the time against an 88.9% classical limit.
- The GHZ parity game's quantum advantage narrowed as more players were added.
- Contextuality tests double as hardware diagnostics by exposing coherent errors that random operations miss.
Google Quantum AI announced on November 19, 2026 that research published on the cover of Science had demonstrated measurement contextuality at scale on its superconducting processors, including a coordination game won 98.3% of the time, above the 88.9% classical limit.
Contextuality means that a measurement outcome is not a predetermined value; it depends on which other compatible measurements are performed alongside it. Theory suggests that this property may power certain quantum algorithms, but earlier demonstrations had mostly involved systems of only a few particles. The new publication reports experiments extending those tests to as many as 105 qubits.
The underlying work was first submitted as an arXiv preprint on December 1, 2025. The November 2026 development is its journal publication, rather than the initial disclosure of the experiments.
A Game Classical Players Cannot Always Win
The preprint’s experimental account begins with the Mermin–Peres magic-square game. Two players, Alice and Bob, can agree on a strategy before being separated. A referee then assigns Alice a row and Bob a column of a three-by-three table. Alice’s entries must multiply to +1 and Bob’s to −1, and the players win when their values match at the intersecting cell.
No prearranged classical table can satisfy those opposing constraints for every assignment. The quantum implementation uses a two-by-two square of qubits and two shared Bell pairs, with an ideal noiseless strategy winning every game. The reported experimental average came from nine row-column assignments, each repeated 100,000 times.
A separate Kochen–Specker–Bell test quantified contextuality with χKSB, a combination of correlations from compatible measurements. The paper reports χKSB = 5.618 ± 0.005, exceeding the classical bound of 4 and approaching the quantum limit of 6, with the remaining difference attributed to experimental errors. Its circuit streamed 180 randomly selected measurement contexts over 1,000 runs.
Scaling the Tests Across Willow Processors
To examine contextuality beyond few-qubit states, the team implemented an N-player GHZ parity game. Each player corresponded to one qubit, and the group shared a GHZ state entangled across those qubits. Each player received a binary question and returned a bit; to win, the parity of their combined answers had to match a value determined by the questions.
The paper reports tests through 71 qubits, with the quantum winning probability above the classical probability at every tested size. Its advantage nevertheless narrowed as players were added. For each player count, the researchers tested 20 games across 50 qubit configurations, repeating each configuration 1,000 times to distinguish performance from statistical fluctuations as the margin contracted.
A separate two-dimensional hidden-linear-function task asked the processor to find a hidden bitstring associated with a symmetric matrix. The experiments used Willow superconducting processors and controlled-Z gates as the native entangling operation, testing sizes from 9 qubits up to the largest device. At each size, the team measured 1,000 random matrices and ran each matrix 100 times.
An error-free implementation returns a correct bitstring after four effective two-qubit-gate layers. To quantify hardware errors, the researchers converted the fraction of correct outputs into an effective depth, a time-to-solution measure reflecting the extra runs needed to obtain a correct answer. The paper reports that this measure rose to about six layers on the largest grid.
Hardware Diagnostics and the Limits of the Separation
The authors propose contextuality-based algorithms as processor benchmarks and report that the many-body versions exposed subtle coherent errors absent from random unitary operations. That gives the tests a hardware-diagnostic role beyond their game scores.
Google presents that error-detection capability as a step toward future chemistry and materials-science applications. Those are stated potential uses; the reported experiments do not simulate either application.
The scope of the quantum-classical separation is equally important. The paper states that no unconditional proof of quantum advantage exists for a general computational model; its results concern particular tasks with bounded resources. For the hidden-linear-function comparison, the established classical lower bound becomes relevant only at roughly one million qubits. The logarithmic near-term classical-depth bound shown against the experimental results is expressly a conjecture, so the measurements do not establish an unconditional advantage over every classical implementation at current processor sizes.
The immediate value is a sharper way to evaluate quantum hardware: contextuality supplies scalable tasks tied to a proposed source of computational advantage, while their sensitivity exposes errors that can remain hidden in less structured tests. At the same time, the shrinking GHZ-game margin and rising effective depth show that preserving the quantum benefit becomes harder as more qubits participate.












