Wed Apr 09 00:00:00 UTC 2025: ## Quantum Supremacy Achieved Using a Simple Game

**Oxford and Seville researchers demonstrate quantum advantage using a two-player colour-coding game, surpassing previous complex methods.**

Scientists have achieved a significant milestone in quantum computing by demonstrating “quantum supremacy” using a surprisingly simple game. Researchers from the University of Oxford and Universidad de Sevilla used a modified version of a mathematically impossible colouring problem to prove the superiority of a quantum computer over a classical one. Their findings, published in *Physical Review Letters*, mark a significant advancement in the field.

Previous demonstrations of quantum supremacy, such as Google’s use of random circuit sampling in 2019 and China’s Gaussian boson sampling, relied on complex problems and specialized equipment, making verification difficult. The new method, however, involves a game where two players, Alice and Bob, attempt to colour the points of an odd-numbered circle with two colours without adjacent points sharing the same colour – a task impossible classically.

Using two entangled strontium atoms and lasers, the researchers simulated the game. A classical computer acting as a referee posed questions about point colours, with success defined by consistent and non-adjacent colour assignments. While a classical computer achieved an 83.3% success rate for a three-point circle, the quantum system significantly outperformed this, achieving a 97.8% success rate across 101,000 trials involving circles with 3 to 27 points. The researchers attributed the 2.2% difference to noise in the entanglement process.

The simplicity of this approach is noteworthy. Previous demonstrations required complex setups; in contrast, this experiment used only two entangled qubits, highlighting the potential for more efficient demonstrations of quantum supremacy. The researchers suggest this method could have practical applications in scenarios requiring coordination between non-communicating agents, such as the rendezvous problem. The study presents a clear and easily understandable example of quantum computing’s power, paving the way for more accessible research and applications in the field.

Read More