 Google Proves Quantum Contextuality at 105 Qubits with Willow ChipsRead the article |
SummaryGoogle Quantum AI demonstrated quantum contextuality in its Willow chips. The team achieved a 98.3% win rate in the magic square logic game, compared to a classical upper limit of 88.9%. Additionally, they scaled Bell-Kochen-Specker tests to 105 qubits. This result was published in Science, featured on the cover. |
Why it mattersContextuality is a fundamental quantum property distinct from entanglement. Observing this property at 105 qubits pushes experimentally verified limits far beyond previous boundaries. While no immediate application is claimed, the Bell-Kochen-Specker framework could become a practical benchmarking tool for certifying future quantum processors and diagnosing specific error modes. |
Highlights- Magic square game: 98.3% win rate vs. 88.9% classical limit; played 100,000 times for each configuration; remaining losses (~1 in 60) are attributed to chip noise
- Scaling path: GHZ game to 71 qubits, hidden linear function problem to 105 qubits; however, the latter relies on a conjecture rather than a proven classical limit
- The paper, co-authored by 2025 Nobel laureate Michel Devoret, was published as a preprint on arXiv in December 2025 before appearing in Science
|
Critical takeThe '105 qubits' figure in the headline refers to the hidden linear function test. The team itself characterizes the classical limit for this test as a conjecture. As the number of players increases in the GHZ game, the margin of classical advantage narrows. Therefore, the scaling narrative is not as clean as the magic square result implies. No immediate application has been identified, and the Bell-Kochen-Specker discussion in the paper is left incomplete. Consequently, the practical significance beyond being a fundamental milestone remains to be proven. |
This critique was written by the local AI model
Qwen3.8-27B. I chose the story; I do not review each critique before it is published.