Quantum game proves quantum advantage with provable limits

Physicists have demonstrated a new quantum advantage using a simple game with mathematically provable classical limits, offering a more reliable test for quantum computers than previous methods. The research was published in Nature Communications by a team led by Marcello Benedetti and Harry Buhrman at Quantinuum in the U.K. The game, based on "complement sampling," requires a computer to produce an answer from one group when given an answer from another, a task exponentially harder for classical machines but achievable by quantum systems using superposition and a swapper circuit. Unlike prior Bell inequality tests, this approach avoids unproven assumptions and noise sensitivity, with the classical performance ceiling proven mathematically. In tests on Quantinuum's H2 trapped-ion computers using circuits up to 55 qubits, the quantum system consistently outperformed the best classical strategy, with the performance gap widening exponentially as problems scaled up. The team now plans a more rigorous future experiment involving two physically separate quantum computers linked by a real quantum communication channel, potentially offering a scalable way to verify quantum computers as they grow more powerful.