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

International Journal of Theoretical and Mathematical Physics

Hidden Optimal Principle in Quantum Mechanics and Quantum Chemistry

Edward Jiménez

Published Aug 9, 2012• 1 citation
Publisher

Abstract

Quantum Mechanic axioms are the result of the microscopic cooperative equilibrium among symmetric players (quantum object and human subject). On the other hand, we introduce Nash’s equilibrium in Hilbert space, which has two characteristics: it is a fixed point and it maximizes a utility function. Moreover, evolution and selfadjoint operators have interesting properties which allow us to study steady state in Evolutionary Game Theory. Also, we present cooperative games in complex systems language.The concept of cooperation is important in game theory but is somewhat subtle. The term cooperate means to act together, with a common purpose. Incentive compatibility is equivalent to synergy principle, which appears naturally (to add or to multiply utilities, ec[34]). Finally, wein the relevant results not only proved the main theorems of Quantum Mechanics, Quantum Chemistry and its applications to salt-water but also we resolved some main questions such us: Do hydrogen-bonded networks, in which tunneling plays an important role, exist?, How cooperation and entropy affect water cluster equilibria?. Can salt (ClNa) play an Nobel role in photo-catalysis?. The answers are: tunnel effect it is possible in salt water but not in water, because ClNa, visible light or electricity incentive to produce catalysis or photo-catalysis. Also, If hydrogen-bonded networks and water cluster size increases complexity of an global equilibrium, then tunnel effect appears as an local equilibrium.

DOI
10.5923/j.ijtmp.20120204.01

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 Theoretic Values of Collaborative and Self-organizing Agents

Ying Zhao, Charles Zhou

When multiple agents collaborate to perform distributed operations, they can be modeled as cooperative games. Considering a network of agents work together and they can only communicate in a limited way (e.g., only to neighbor peers), the goal is to maximize the cooperation success globally, or maximize the total value and social welfare of the whole network. The type of cooperation is challenging since the game is not zero-sum. There are not any outside agents to serve as referees. The objective functions may be non-stationary and non-convex. In this paper, each agent is modeled as a content supplier or consumer. Each agent optimizes its own objective locally. We show that each agent self-organizes or converges to its "value" via the principles of quantum computing and game theories. We prove two theorems that can optimize an agent's own objective and simultaneously optimize the global social welfare of its peer network. The quantum intelligence game algorithms are unsupervised and self-organizing, where the weights expressed in quantum neural networks or transformers can be computed from a natural mechanism known as a quantum adiabatic evolution.

IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)•Nov 6, 2023•2 citations

Topological Quantum Nash Equilibria: Reconciling Pareto Optimality through Von Neumann Entropy Constraints

Yassin Tanan

We formulate a rigorous mathematical proof demonstrating that the structural divergence between Nash equilibria and Pareto optimality in non-cooperative games can be strictly eliminated within a topologically protected quantum strategy space. Classical game theory frequently identifies equilibria, such as the Prisoner’s Dilemma, where individual rationality leads to systemic inefficiency. By mapping these strat- egy profiles into a composite finite-dimensional Hilbert space (H= NHi), we introduce a global entanglement operator that acts as a fundamental topological constraint on the action space. We prove that any unilateral local deviation representing opportunistic rent-seeking or information asymmetry acts as a non-unitary positive operator-valued measure (POVM). Invoking the No-Cloning theorem and the Araki-Lieb inequality, we formally demonstrate that such deviations unavoidably induce a partial trace over the global system, generating a strictly positive increase in local von Neumann entropy (S(ρi) > 0). This topological decoherence imposes a definitive thermodynamic penalty on the local utility observable, effectively internalizing the cost of friction. Consequently, we establish the existence and uniqueness of the Topological Quantum Nash Equilibrium (QNE), proving that under these specific geometric and quantum-mechanical constraints, the unique rational best response strictly converges to the global Pareto optimum. This framework provides a definitive information-theoretic resolution to systemic market inefficiencies.

•May 2, 2026•0 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

Study of Nash equilibrium by increasing game parameters in 3-player quantum game

H. Goudarzi, Sohrab Minaei Beirami

Using the quantum game formalism in 3-player system, we calculate the Nash equilibrium in quantum Prisoners’ Dilemma by increasing parameters of unitary operator. Since, the entanglement plays an important role in quantum states of particles quantum game, actually its effect on the obtained results of Nash equilibrium is investigated. It is shown that increasing the parameters enhances the game payoff function.

Iranian Journal of Physics Research•Mar 15, 2013•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
Quantum Mechanic axioms are the result of the microscopic cooperative equilibrium among symmetric players (quantum object and human subject). On the other hand, we introduce Nash’s equilibrium in Hilbert space, which has two characteristics: it is a fixed point and it maximizes a utility function. Moreover, evolution and selfadjoint operators have interesting properties which allow us to study steady state in Evolutionary Game Theory. Also, we present cooperative games in complex systems language.The concept of cooperation is important in game theory but is somewhat subtle. The term cooperate means to act together, with a common purpose. Incentive compatibility is equivalent to synergy principle, which appears naturally (to add or to multiply utilities, ec[34]). Finally, wein the relevant results not only proved the main theorems of Quantum Mechanics, Quantum Chemistry and its applications to salt-water but also we resolved some main questions such us: Do hydrogen-bonded networks, in which tunneling plays an important role, exist?, How cooperation and entropy affect water cluster equilibria?. Can salt (ClNa) play an Nobel role in photo-catalysis?. The answers are: tunnel effect it is possible in salt water but not in water, because ClNa, visible light or electricity incentive to produce catalysis or photo-catalysis. Also, If hydrogen-bonded networks and water cluster size increases complexity of an global equilibrium, then tunnel effect appears as an local equilibrium.
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.
When multiple agents collaborate to perform distributed operations, they can be modeled as cooperative games. Considering a network of agents work together and they can only communicate in a limited way (e.g., only to neighbor peers), the goal is to maximize the cooperation success globally, or maximize the total value and social welfare of the whole network. The type of cooperation is challenging since the game is not zero-sum. There are not any outside agents to serve as referees. The objective functions may be non-stationary and non-convex. In this paper, each agent is modeled as a content supplier or consumer. Each agent optimizes its own objective locally. We show that each agent self-organizes or converges to its "value" via the principles of quantum computing and game theories. We prove two theorems that can optimize an agent's own objective and simultaneously optimize the global social welfare of its peer network. The quantum intelligence game algorithms are unsupervised and self-organizing, where the weights expressed in quantum neural networks or transformers can be computed from a natural mechanism known as a quantum adiabatic evolution.
We formulate a rigorous mathematical proof demonstrating that the structural divergence between Nash equilibria and Pareto optimality in non-cooperative games can be strictly eliminated within a topologically protected quantum strategy space. Classical game theory frequently identifies equilibria, such as the Prisoner’s Dilemma, where individual rationality leads to systemic inefficiency. By mapping these strat- egy profiles into a composite finite-dimensional Hilbert space (H= NHi), we introduce a global entanglement operator that acts as a fundamental topological constraint on the action space. We prove that any unilateral local deviation representing opportunistic rent-seeking or information asymmetry acts as a non-unitary positive operator-valued measure (POVM). Invoking the No-Cloning theorem and the Araki-Lieb inequality, we formally demonstrate that such deviations unavoidably induce a partial trace over the global system, generating a strictly positive increase in local von Neumann entropy (S(ρi) > 0). This topological decoherence imposes a definitive thermodynamic penalty on the local utility observable, effectively internalizing the cost of friction. Consequently, we establish the existence and uniqueness of the Topological Quantum Nash Equilibrium (QNE), proving that under these specific geometric and quantum-mechanical constraints, the unique rational best response strictly converges to the global Pareto optimum. This framework provides a definitive information-theoretic resolution to systemic market inefficiencies.
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.