Quantum Go: Designing a Proof-of-Concept on Quantum Computer

TL;DR

This paper introduces a quantum version of the Go game, demonstrating quantum superposition, collapse, and entanglement, and compares its complexity with classical Go to showcase quantum computing's potential advantages.

Contribution

It presents a novel quantum Go game model that incorporates superposition and quantum moves, providing an educational tool and analyzing its complexity relative to classical Go.

Findings

Quantum Go demonstrates superposition and collapse in gameplay.

Quantum complexity of Go is significantly different from classical complexity.

The model serves as an educational introduction to quantum concepts.

Abstract

The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states |0> and |1> and the players have two kinds of moves (classical and quantum) to mark each box. The mark on each box depends on the state to which the qubit collapses after the measurement. All other rules remain the same, except for here, we capture only one stone and not chains. Due to the enormous power and exponential speed-up of quantum computers as compared to classical computers, we may think of quantum computing as the future. So, here we provide a tangible introduction to superposition, collapse, and entanglement via our version of quantum Go. Finally, we compare the classical complexity with the quantum complexity involved in playing the Go game.