论文标题
量子GO：在量子计算机上设计概念验证
Quantum Go: Designing a Proof-of-Concept on Quantum Computer
论文作者
论文摘要
以繁琐的数学复杂性而闻名的战略GO游戏已被用作许多小说，电影和书籍中的主题。在这里，我们介绍了GO游戏，并提供了新版本的量子GO，其中框最初位于量子状态| 0> and | 1>>>>>>>>>>>>>>>>>>上，并且玩家有两种动作（经典和量子）来标记每个盒子。每个框上的标记取决于测量后Qubit倒塌的状态。除此之外，所有其他规则均保持不变，除非我们只捕获一块石头而不是链条。由于与经典计算机相比，量子计算机的巨大功率和指数加速，我们可能会认为量子计算是未来。因此，在这里，我们通过我们的Quantum Go版本提供了对叠加，崩溃和纠缠的切实介绍。最后，我们将经典的复杂性与玩GO游戏所涉及的量子复杂性进行了比较。
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.
