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

Quaternions, Octonions, and the Quantization of Games

Aden Ahmed

Published Apr 20, 2009• 1 citation
Publisher

Abstract

We present an effect on classical games that is obtained by replacing the notion of probability distribution with the notions of quantum superposition and measurement. Our particular focus will be on two and three player games where each player has precisely two pure strategic choices. Games in normal form are represented as "payoff" functions. Game quantization requires the extension of these functions to much larger domains. The main result of this work is the co-ordinatization of these extended functions by either the quaternions or octonions in order to obtain computationally friendly versions of these functions. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the new extended games with occasionally counter intuitive results.

DOI
10.15760/etd.7814

Related papers

OCTONIONIZATION OF THREE PLAYER, TWO STRATEGY MAXIMALLY ENTANGLED QUANTUM GAMES

ADEN OMAR AHMED, STEVEN A. BLEILER, FAISAL SHAH KHAN

We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the quantum games.

arXiv:0808.1391•International Journal of Quantum Information•Apr 1, 2010•11 citations

Equilibria in Quantum Three-Player Dilemma Game

Aden Ahmed

After a brief exploration of certain topological features of the unit octonions, we identify the Nash equilibria in a quantized version of three-player dilemma game using an octonionic representation of the payoff function. This representation is an important tool for the relative ease in working with octonionic arithmetic as opposed to multi-variant tensors and provides a fresh computational framework that can be utilized for the classification of Nash equilibria in generic three-player two-strategy games. While the full classification of equilibria remains a goal of future research, our representation has already established certain family of equilibria in a quantized version of three-player dilemma game.

British Journal of Mathematics & Computer Science•Jan 10, 2013•2 citations

Geometry of Nash Equilibrium in Quantum Hawk-Dove Games

Faisal Shah Khan

A game is said to be “quantized" when the expected payoff to the player(s) is computed via the higher order randomization notion of quantum superposition followed by measurement versus the randomization notion of probability distribution. A major motivation for quantizing a game is the potential manifestation of Nash equilibria that are superior to those already available in the game. Quantum superpositions are elements of a (projective) Hilbert space which, among other things, is an inner product space. The inner product of the Hilbert space of quantum superpositions is used here to give a geometric characterization of Nash equilibrium in quantized versions of Hawk-Dove games, a class of games to which the well known game Prisoners

•Aug 1, 2011•0 citations

Nash Equilibria in Four-Strategy Quantum Extensions of the Prisoner’s Dilemma Game

Piotr Frąckiewicz, Anna Gorczyca–Goraj, Krzysztof Grzegorz Grzanka +2 more

The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.

arXiv:2411.01711•Entropy•Jul 15, 2025•3 citations

A game theoretic approach to quantizing Markov processese

Steven A. Bleiler, Faisal Shah Khan

In the context of quantum information theory, “quantization” of various mathematical constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of probability distribution with higher order randomization notions from quantum mechanics such as quantum superposition with measurement. For this to be done “properly”, a faithful copy of the original construction is required to exist within the new “quantum” one, just as is required when a function is extended to a larger domain. Here, Markov processes that serve as mathematical models of history dependent Parrondo games are quantized properly.

IEEE GCC Conference and Exhibition (GCCCE)•Feb 1, 2011•0 citations

The Strategic Form of Quantum Prisoners' Dilemma

Ahmad Nawaz

In a normal form, prisoners' dilemma (PD) is represented by a payoff matrix showing players' strategies and payoffs. To obtain the distinguishing trait and strategic form of PD, certain constraints are imposed on the elements of its payoff matrix. We quantize PD by a generalized quantization scheme to analyze its strategic behavior in the quantum domain. The game starts with a general entangled state of the form and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements, there exist respective cutoff values of entanglement of the initial quantum state up to which the strategic form of the game remains intact. Beyond these cutoffs the quantized PD behaves like the chicken game (CG) up to another cutoff value. For the measurement in the entangled basis the dilemma is resolved for sinξ > 1/7 with Q ⊗ Q as a Nash Equilibrium (NE). However, the quantized game behaves like PD when sinξ > 1/3; whereas in the range 1/7 < sinξ < 1/3 it behaves like CG with Q ⊗ Q as an NE. For the measurement in the product basis the quantized PD behaves like classical PD for with D ⊗ D as an NE. In region , the quantized PD behaves like classical CG with C ⊗ D and D ⊗ C as NEs.

arXiv:1307.6541•Chinese Physics Letters•May 1, 2013•13 citations
We present an effect on classical games that is obtained by replacing the notion of probability distribution with the notions of quantum superposition and measurement. Our particular focus will be on two and three player games where each player has precisely two pure strategic choices. Games in normal form are represented as "payoff" functions. Game quantization requires the extension of these functions to much larger domains. The main result of this work is the co-ordinatization of these extended functions by either the quaternions or octonions in order to obtain computationally friendly versions of these functions. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the new extended games with occasionally counter intuitive results.
After a brief exploration of certain topological features of the unit octonions, we identify the Nash equilibria in a quantized version of three-player dilemma game using an octonionic representation of the payoff function. This representation is an important tool for the relative ease in working with octonionic arithmetic as opposed to multi-variant tensors and provides a fresh computational framework that can be utilized for the classification of Nash equilibria in generic three-player two-strategy games. While the full classification of equilibria remains a goal of future research, our representation has already established certain family of equilibria in a quantized version of three-player dilemma game.
A game is said to be “quantized" when the expected payoff to the player(s) is computed via the higher order randomization notion of quantum superposition followed by measurement versus the randomization notion of probability distribution. A major motivation for quantizing a game is the potential manifestation of Nash equilibria that are superior to those already available in the game. Quantum superpositions are elements of a (projective) Hilbert space which, among other things, is an inner product space. The inner product of the Hilbert space of quantum superpositions is used here to give a geometric characterization of Nash equilibrium in quantized versions of Hawk-Dove games, a class of games to which the well known game Prisoners
The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.
In the context of quantum information theory, “quantization” of various mathematical constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of probability distribution with higher order randomization notions from quantum mechanics such as quantum superposition with measurement. For this to be done “properly”, a faithful copy of the original construction is required to exist within the new “quantum” one, just as is required when a function is extended to a larger domain. Here, Markov processes that serve as mathematical models of history dependent Parrondo games are quantized properly.
In a normal form, prisoners' dilemma (PD) is represented by a payoff matrix showing players' strategies and payoffs. To obtain the distinguishing trait and strategic form of PD, certain constraints are imposed on the elements of its payoff matrix. We quantize PD by a generalized quantization scheme to analyze its strategic behavior in the quantum domain. The game starts with a general entangled state of the form and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements, there exist respective cutoff values of entanglement of the initial quantum state up to which the strategic form of the game remains intact. Beyond these cutoffs the quantized PD behaves like the chicken game (CG) up to another cutoff value. For the measurement in the entangled basis the dilemma is resolved for sinξ > 1/7 with Q ⊗ Q as a Nash Equilibrium (NE). However, the quantized game behaves like PD when sinξ > 1/3; whereas in the range 1/7 < sinξ < 1/3 it behaves like CG with Q ⊗ Q as an NE. For the measurement in the product basis the quantized PD behaves like classical PD for with D ⊗ D as an NE. In region , the quantized PD behaves like classical CG with C ⊗ D and D ⊗ C as NEs.