Playing Dice with the Universe: Programming Quantum Computers to Play Traditional Games
Tristan Zaborniak, Vikram Khipple Mulligan

TL;DR
This paper demonstrates programming a quantum annealer to play tic-tac-toe, showcasing quantum computers' potential to implicitly evaluate game outcomes and serve as benchmarks for real-world applications.
Contribution
It introduces a method to program quantum annealers with game rules, enabling them to play games without explicit strategies, as a proof of concept with tic-tac-toe.
Findings
Quantum annealer successfully played tic-tac-toe against a human.
Programmed rules allowed implicit evaluation of game outcomes.
Quantum game-playing can serve as a benchmark for quantum computing.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
