Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1007.3310

Simultaneous Go via quantum collapse

Yasha Savelyev

Published Jul 19, 2010• 0 citations
arXivHTMLPDF

Abstract

We construct a symmetric, simultaneous, deterministic evolution game $SGo$, which is in a certain mathematical sense a symmetrization of the classical board game Go. $SGo$ is in some ways a simpler game than Go, as Komi, Ko and suicide rules are removed. On the other hand it has similar dynamics and move sensitivity, enabled by certain deterministic ``quantum state'' reduction, so that state evolution is deterministic. Using the argument of Nash, we show that $SGo$ has a mixed equilibrium strategy to draw on average.

DOI
10.48550/arxiv.1007.3310

Related papers

On Topics in Quantum Games

Y. Avishai

This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.

Journal of Quantum Information Science•Jan 1, 2023•9 citations

Quantum Game Theory: Transforming Nash Equilibrium Through Superposition, Entanglement, and Interference

易先 周

In classical game theory, players are limited to deterministic strategies or probabilistic mixed strategies. Quantum game theory introduces quantum mechanical principles—superposition and entanglement—fundamentally altering game structures and redefining Nash equilibria.

•Jul 10, 2026•0 citations

Quantum version of the Monty Hall problem

Adrian P. Flitney, Derek Abbott

A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than that obtained with a classical mixed strategy. However, if the initial state involves entanglement of the qutrits of the two players, it is advantageous for one player to have access to a quantum strategy while the other does not. Where both players have access to quantum strategies there is no Nash equilibrium in pure strategies, however, there is a Nash equilibrium in quantum mixed strategies that gives the same average payoff as the classical game.

arXiv:quant-ph/0109035•Physical Review A•Jun 14, 2002•132 citations

Some Topics in Quantum Games

Y. Avishai

This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.

arXiv:1306.0284•Jun 3, 2013•14 citations

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

Shibashankar Sahu, Biswaranjan Panda, Arnab Chowhan +2 more

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.

arXiv:2206.05250•Jun 10, 2022•2 citations

Quantum Go

André Ranchin

We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing pairs of entangled go stones. A phenomenon of quantum-like collapse occurs when one of the stones in an entangled pair is directly in contact with at least one other stone. The player to whom the entangled pair belongs must then remove one of the stones in the pair from the board. The aim of the game is still to surround more territory than the opponent and as the number of stones increases, all the entangled pairs of stones eventually reduce to single stones. Quantum Go provides an interesting and tangible illustration of quantum concepts such as superposition, entanglement and collapse.

arXiv:1603.04751•Mar 15, 2016•10 citations
We construct a symmetric, simultaneous, deterministic evolution game SGoSGoSGo, which is in a certain mathematical sense a symmetrization of the classical board game Go. SGoSGoSGo is in some ways a simpler game than Go, as Komi, Ko and suicide rules are removed. On the other hand it has similar dynamics and move sensitivity, enabled by certain deterministic ``quantum state'' reduction, so that state evolution is deterministic. Using the argument of Nash, we show that SGoSGoSGo has a mixed equilibrium strategy to draw on average.
This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.
A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than that obtained with a classical mixed strategy. However, if the initial state involves entanglement of the qutrits of the two players, it is advantageous for one player to have access to a quantum strategy while the other does not. Where both players have access to quantum strategies there is no Nash equilibrium in pure strategies, however, there is a Nash equilibrium in quantum mixed strategies that gives the same average payoff as the classical game.
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.
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.
We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing pairs of entangled go stones. A phenomenon of quantum-like collapse occurs when one of the stones in an entangled pair is directly in contact with at least one other stone. The player to whom the entangled pair belongs must then remove one of the stones in the pair from the board. The aim of the game is still to surround more territory than the opponent and as the number of stones increases, all the entangled pairs of stones eventually reduce to single stones. Quantum Go provides an interesting and tangible illustration of quantum concepts such as superposition, entanglement and collapse.