# Google Research — A game you cannot win unless you have a quantum computer

- Company: Google Research (research.google)
- Announced: 2026-11-19T20:03:00+00:00
- Category: research-paper
- Coverage: not counted
- Announcement: yes
- Group: announcements
- Source: https://research.google/blog/a-game-you-cannot-win-unless-you-have-a-quantum-computer/
- Record: https://forck.live/items/38867-a-game-you-cannot-win-unless-you-have-a-quantum-computer
- Subject: Research

Google Quantum AI says it demonstrated and measured quantum contextuality on its superconducting processors, winning the magic square game 98.3% of the time and outperforming classical strategies in tasks spanning up to 105 qubits. The work, published in Science, addresses whether contextuality survives in the many-body systems real quantum computers are made of, since it had been shown almost exclusively in small systems of a few particles. In the magic square game, Alice and Bob each hold two qubits sharing two entangled Bell pairs and measure them with preset settings; the best classical strategy wins at most 88.89% of rounds. Google ran all nine versions of the game 100,000 times apiece on its Willow processor, losing roughly one in sixty rounds, a result it reports as 98.30% (0.9830 ± 0.0001). The team also used a state-independent Bell–Kochen–Specker inequality, χ = R1 + R2 + R3 − C1 − C2 − C3, where any universe with predetermined outcomes must obey χ ≤ 4 while quantum mechanics permits values up to 6. Google says the tasks proved a sensitive new benchmark for quantum hardware, catching subtle errors that random-circuit tests miss.

## Evidence

Verbatim from https://research.google/blog/a-game-you-cannot-win-unless-you-have-a-quantum-computer/:

> On a superconducting processor, we turned one of quantum mechanics’ strangest features into something you can measure, benchmark, and put to work across systems as large as 105 qubits.
> 
> Quick links
> 
> Here is a Sunday paper-style puzzle you can try right now. Draw a 3×3 grid. Fill every cell with either +1 or −1, subject to two rules: each row must multiply to +1, and each column must multiply to −1.
> 
> Go ahead. We’ll wait…
> 
> You didn’t manage it, right? There is an elegant reason for that. For a row to multiply to +1, it needs an even number of −1s. For a column to multiply to −1, it needs an odd number. Add up the rows and you learn the grid contains an even number of −1s. Add up the columns and you learn it contains an odd number. Well…That’s impossible!
> 
> The grid would have to be two contradictory things at once. No such table exists; it is a paradox.
> 
> Now turn the puzzle into a game: Each round, Alice is handed a row and Bob a column. Without talking, Alice fills her row by the row rule and Bob fills his column by the column rule. They win if they put the same number in the square where their row and column intersect.

---

Record: https://forck.live/items/38867-a-game-you-cannot-win-unless-you-have-a-quantum-computer
Catalogue: https://forck.live/llms.txt
Current issue: https://forck.live/feed.md
