
Google Research
· 2 min read
A game you cannot win unless you have a quantum computer
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. Any plan made in advance is just a pre-written table, meaning at best they will win 8 out of 9 rounds. This changes if they use a quantum computer. It won't fill in the impossible grid, but in principle, it lets them win every round.
The reason is a property called quantum contextuality, arguably the strangest feature of quantum mechanics. Einstein once famously asked whether the moon is there when nobody looks, his way of insisting that physical properties ought to exist whether or not anyone measures them. For quantum systems, contextuality is the precise, experimentally testable statement that the answer can be no: you cannot assign fixed, pre-existing values to everything you might measure.
Beating the classical bound
We ran what is commonly called the magic square game on our Willow quantum processor. Alice and Bob each hold two qubits, sharing two entangled Bell pairs instead of a pre-written table, and measure them using preset settings for their assigned row or column to get their ±1 entries.
Original source
This story was published by Google Research. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on research.google


