🤖 AI Summary
This work proposes a quantum game-playing approach that requires neither predefined strategies nor training data. By encoding the rules of tic-tac-toe directly as a quantum optimization problem on a D-Wave quantum annealer, the method leverages quantum superposition and sampling to implicitly explore all legal moves and select optimal actions. This represents the first demonstration of a purely rule-driven quantum game-playing system capable of interactive play against human opponents. The results confirm that quantum hardware can exhibit fundamental decision-making capabilities in a real-world game setting without any learning or hard-coded heuristics, thereby establishing a novel benchmark for evaluating quantum computing systems on authentic decision tasks.
📝 Abstract
The challenge of programming classical computers to play traditional, competitive games against human players has helped to advance classical hardware and software. Quantum computers have the potential to play games in a unique way: programmed only with the rules of a game, they should be able to implicitly represent all future paths of a game leading to wins, losses, or draws, and sample from this path set to identify moves that maximize the likelihood of a win. This permits skilled play without hard-coded or machine-learned strategy. As a proof of principle, we present early results obtained after programming the D-Wave quantum annealer with the rules of tic-tac-toe, enabling it to play against a human opponent. We anticipate that, as it has for classical computers, game-playing will serve as an important real-world benchmark for quantum computers.