Skip to content
Technology & InnovationLatest

Google Quantum Chip Solves 'Impossible' Game

Published

Google's Willow quantum processor has achieved a significant milestone, successfully navigating a mathematical coordination game with a success rate of 98.3%, surpassing the 88.9% maximum achievable through classical strategies.

MissedBlock Desk · 3 min read

Google Quantum Chip Solves 'Impossible' Game

Quantum Processor Demonstrates Enhanced Coordination in Scientific Study

Google’s Willow quantum processor has achieved a significant milestone, successfully navigating a mathematical coordination game with a success rate of 98.3%, surpassing the 88.9% maximum achievable through classical strategies. The findings were detailed in a study published Thursday in the journal Science.

The experiment focused on “quantum contextuality,” a phenomenon where the outcomes of measurements are influenced by other measurements being performed simultaneously. Google researchers explained that this means “you cannot assign fixed, pre-existing values to everything you might measure.”

It is important to note that this achievement does not signify the existence of a commercial quantum computer from Google, nor does it imply that its largest experimental run outperformed all classical machines. The 98.3% success rate was achieved using four qubits, the fundamental units of quantum information. A separate test involving 105 qubits addressed a different, more constrained challenge.

The Mermin-Peres Magic Square Game

The initial test employed the Mermin-Peres magic square game. In this game, two players are tasked with filling intersecting cells of a three-by-three grid without any communication. Their entries must adhere to conflicting row and column rules while also matching at the shared cells.

A pre-arranged classical strategy can achieve a maximum success rate of eight out of nine assignments, equating to 88.9%. While entangled qubits theoretically have the potential to win every round, Google’s physical processor, across 900,000 trials, secured a 98.3% success rate, according to the researchers.

The researchers noted that “our qubits coordinated better than any pre-written table allows.” They attributed the inability to reach the theoretical quantum ideal to unavoidable hardware noise.

Measuring Contextuality and GHZ Parity Game

Google also quantified contextuality. Models that rely on predetermined outcomes can score a maximum of 4, whereas quantum theory permits a score of 6. Willow registered a score of 5.590, with a reported uncertainty of 0.008.

A separate GHZ parity game involved up to 71 entangled qubits tasked with delivering coordinated binary answers. Success was measured against the strongest classical winning rate, which approaches 50% as the number of players increases. Google’s processor consistently remained above this limit throughout its tests, even with accumulating hardware noise.

Entanglement Verification and Hidden Linear Function Task

Researchers also confirmed genuine entanglement across 45 qubits. In the hidden linear function task, a shallow quantum circuit was required to generate a binary string that satisfied specific mathematical constraints. The processor achieved approximately 60% success using 105 qubits.

Google stated that these tasks revealed subtle, systematic errors that might go undetected by conventional randomized tests. The company’s corporate blog described contextuality testing as “a sensitive new method to catch subtle hardware errors,” potentially aiding engineers in evaluating circuits used for chemistry and materials research.

This work builds upon Google’s October report detailing a 40-fold reduction in errors during the preparation of magic states, a crucial resource for fault-tolerant quantum computing.

While the prospect of future fault-tolerant quantum computers posing a threat to Bitcoin’s digital signatures remains a distant concern, Google’s 105-qubit task involved a shallow mathematical circuit, with its largest instance still failing approximately 40% of the time.

Google Quantum Chip Solves 'Impossible' Game · MissedBlock