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:1502.06215

Optimal quantum data classification

Faisal Shah Khan

Published Feb 22, 2015• 1 citation
arXivHTMLPDF

Abstract

The problem of simultaneously distinguishing a pure quantum state, generated by some quantum mechanical process, from its constituent observable states optimally is introduced and solved using a non-cooperative game model and the affiliated solution concept of Nash equilibrium. The notion of Nash equilibrium quantum states is introduced and used to classify quantum data optimally.

Related papers

Nash Embedding and Equilibrium in Pure Quantums States

Faisal Shah Khan, Travis S. Humble

With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.

•Aug 1, 2018•0 citations

Gaming the quantum

Faisal Shah Khan, Simon J. D. Phoenix

In the time since the merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of ``quantized games'', and of applying game theory to quantum mechanics, referred to henceforth as ``gaming the quantum'', have become synonymous under the single ill-defined term ``quantum game''. Here, these two perspectives are delineated and a game-theoretically proper description of what makes a multiplayer, non-cooperative game quantum mechanical, is given. Within the context of this description, finding Nash equilibrium in a zero-sum quantum game is exhibited to be equivalent to finding a solution to a simultaneous distance minimization problem in the state space of quantum objects, thus setting up a framework for a game theory inspired study of ``equilibrium'' behavior of quantum physical systems such as those utilized in quantum information processing and computation.

arXiv:1202.1142•Quantum Information and Computation•Mar 1, 2013•8 citations

A Decision-Optimization Approach to Quantum Mechanics and Game Theory

Xiaofei Huang

The fundamental laws of quantum world upsets the logical foundation of classic physics. They are completely counter-intuitive with many bizarre behaviors. However, this paper shows that they may make sense from the perspective of a general decision-optimization principle for cooperation. This principle also offers a generalization of Nash equilibrium, a key concept in game theory, for better payoffs and stability of game playing.

arXiv:0911.5548•Nov 30, 2009•0 citations

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 games: Numerical approach

Y. Avishai

In classical (standard) game theory, a useful algorithm for searching Nash equilibrium in games of two players, is to determine the best response functions. For each strategy S1 of player 1 player 2 finds a best response function F2(S1), and vice versa. If the two response functions intersect, the intersection point (S1*, S2*) is a candidate for Nash equilibrium. This method is especially useful when the strategy space of each player is determined by a single variable (discrete or continuous). In the last decade, the concept of quantum games has been developed (hence we distinguish between classical and quantum games). In a quantum game with two players the strategy space of each player is composed of 2 × 2 complex unitary matrices with unit determinant. That is the group SU(2). The corresponding strategy space is characterized by three continuous variables represented by angles: 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, 0 ≤ θ ≤ π. That turns the use of response functions impractical. In the present contribution we suggest a method for alleviating this problem by discretizing the variables as: {αi, βj, θk}, i= 1, 2, ..., I; j = 1, 2, ..., J; k = 1, 2, ... K. This enables the representation of every such triple by a single discrete variable, (αi, βj, θk) → xijk. Thereby, the strategy space is characterized by a single discrete variable taking I × J × K values and the method of response functions is feasible. We use it to show the following two results: 1) A two players quantum game with partially entangled initial state has a pure strategy Nash equilibrium. 2) A two player quantum Bayesian game with fully entangled initial state has a pure strategy Nash equilibrium.

International Conference on Natural Computation (ICNC)•May 1, 2012•1 citation

No fixed-point guarantee of Nash equilibrium in quantum games

Faisal Shah Khan, Travis S. Humble

The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg's fixed-point theorem do not apply to pure quantum games when the payoff is a physical observable. We further show that Nash equilibrium can be guaranteed when the payoff is defined with respect to state preparation.

arXiv:1609.08360•Sep 27, 2016•1 citation
The problem of simultaneously distinguishing a pure quantum state, generated by some quantum mechanical process, from its constituent observable states optimally is introduced and solved using a non-cooperative game model and the affiliated solution concept of Nash equilibrium. The notion of Nash equilibrium quantum states is introduced and used to classify quantum data optimally.
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.
In the time since the merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of ``quantized games'', and of applying game theory to quantum mechanics, referred to henceforth as ``gaming the quantum'', have become synonymous under the single ill-defined term ``quantum game''. Here, these two perspectives are delineated and a game-theoretically proper description of what makes a multiplayer, non-cooperative game quantum mechanical, is given. Within the context of this description, finding Nash equilibrium in a zero-sum quantum game is exhibited to be equivalent to finding a solution to a simultaneous distance minimization problem in the state space of quantum objects, thus setting up a framework for a game theory inspired study of ``equilibrium'' behavior of quantum physical systems such as those utilized in quantum information processing and computation.
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.
In classical (standard) game theory, a useful algorithm for searching Nash equilibrium in games of two players, is to determine the best response functions. For each strategy S1 of player 1 player 2 finds a best response function F2(S1), and vice versa. If the two response functions intersect, the intersection point (S1*, S2*) is a candidate for Nash equilibrium. This method is especially useful when the strategy space of each player is determined by a single variable (discrete or continuous). In the last decade, the concept of quantum games has been developed (hence we distinguish between classical and quantum games). In a quantum game with two players the strategy space of each player is composed of 2 × 2 complex unitary matrices with unit determinant. That is the group SU(2). The corresponding strategy space is characterized by three continuous variables represented by angles: 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, 0 ≤ θ ≤ π. That turns the use of response functions impractical. In the present contribution we suggest a method for alleviating this problem by discretizing the variables as: {αi, βj, θk}, i= 1, 2, ..., I; j = 1, 2, ..., J; k = 1, 2, ... K. This enables the representation of every such triple by a single discrete variable, (αi, βj, θk) → xijk. Thereby, the strategy space is characterized by a single discrete variable taking I × J × K values and the method of response functions is feasible. We use it to show the following two results: 1) A two players quantum game with partially entangled initial state has a pure strategy Nash equilibrium. 2) A two player quantum Bayesian game with fully entangled initial state has a pure strategy Nash equilibrium.
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg's fixed-point theorem do not apply to pure quantum games when the payoff is a physical observable. We further show that Nash equilibrium can be guaranteed when the payoff is defined with respect to state preparation.