Google has demonstrated that its Willow quantum processor can win a mathematical coordination game at a rate exceeding the maximum possible for classical systems, achieving 98.3% success in a four-qubit test where even the best prearranged classical strategy tops out at 88.9%. The result, published Thursday, tests quantum contextuality, the principle that measurement outcomes depend on what else is measured alongside them.
The experiment used the Mermin-Peres magic square game, in which two players fill intersecting parts of a three-by-three grid without communicating. Their answers must obey conflicting row-and-column rules and match at the shared square. A prearranged classical strategy can succeed on no more than eight of nine assignments, or 88.9%. Entangled qubits can theoretically win every round, while Google’s physical processor won 98.3% across 900,000 trials, according to the researchers.
The researchers wrote that “our qubits coordinated better than any pre-written table allows.” Unavoidable hardware noise prevented the result from reaching the quantum ideal.
Google also measured contextuality. Any model with predetermined outcomes scores at most 4; quantum theory allows 6. Willow registered 5.590, with a reported uncertainty of 0.008.
In a separate GHZ parity game, up to 71 entangled qubits were asked to deliver coordinated binary answers. Google remained above the strongest classical winning rate, which approaches 50% with more players, despite accumulating hardware noise. Researchers also verified genuine entanglement across 45 qubits.
In the hidden linear function task, a shallow quantum circuit had to produce a binary string satisfying mathematical constraints. The processor reached roughly 60% success using 105 qubits.
Google says the tasks exposed small, systematic errors that conventional randomized tests can hide. Google called contextuality testing “a sensitive new method to catch subtle hardware errors,” potentially helping engineers evaluate circuits used for chemistry and materials research.
The result does not mean Google has a commercial quantum computer, nor that its largest experiment beat every classical machine. The 98.3% figure came from four qubits; the 105-qubit run tested a different, more limited challenge and still failed about four out of 10 times.
The work follows Google’s reported 40-fold error reduction in preparing magic states, a resource needed for fault-tolerant quantum computing. For Bitcoin, a future fault-tolerant quantum computer could break digital signatures, but that is still far from happening.
Analysis
Why This Matters
- The result experimentally confirms quantum contextuality, a deep principle that separates quantum from classical physics, and demonstrates that near-term quantum hardware can exploit it for tasks classical computers cannot match.
- Contextuality testing offers a sensitive new diagnostic for subtle hardware errors, which could help engineers build more reliable quantum circuits for chemistry and materials research.
- While not a threat to cryptography today, the work advances the understanding of quantum advantage, a step on the long road toward fault-tolerant quantum computing.
Background
Quantum contextuality is the idea that the outcome of a measurement on a quantum system depends on what other measurements are performed at the same time. This contradicts classical physics, where properties exist independently of being measured. Google’s Willow processor is a superconducting quantum chip designed to manipulate qubits, the fundamental units of quantum information. The experiments test the chip against games and tasks where quantum entanglement provides a provable advantage over any classical strategy.
Key Perspectives
Google / Researchers: Argue that the chip’s performance, while not yet fault-tolerant, demonstrates a “sensitive new method to catch subtle hardware errors” and that their qubits “coordinated better than any pre-written table allows.” They note that hardware noise still prevents the quantum ideal.
Cautionary view (implicit in the reporting): The largest test, involving 105 qubits, succeeded only about 60% of the time, and the headline result (98.3%) used only four qubits. The processor is not a commercial quantum computer and does not beat every classical machine.
What to Watch
- Whether Google can reduce hardware noise further to close the gap between physical results and quantum limits.
- The next milestone toward fault-tolerant computing: demonstrating logical qubits with error rates low enough for practical algorithms.
- Broader adoption of contextuality-based benchmarks by other quantum computing teams as a standard diagnostic.