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

Nash equilibria in quantum state estimation and cloning games

Chiu Fan Lee, Neil F. Johnson

Published Jul 24, 2002• 1 citation
OpenAlex

Abstract

We apply a generalized quantum game formalism to the phenomena of quantum cloning and quantum state estimation. We find that both phenomena can be usefully viewed as quantum games. We compute the corresponding Nash equilibria and payoffs for both phenomena. Our work also provides a new perspective on quantum cryptography.

Related papers

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

Quantumizing Classical Games: An Introduction to Quantum Game Theory

Sowmitra Das

We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to $\textit{Quantumize}$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.

arXiv:2305.00368•Apr 30, 2023•5 citations

Quantum game theory

Michael L. Stohler

Non-cooperative quantum games have received much attention recently. This thesis defines and divides current works into two major categories of gaming techniques with close attention paid to Nash equilibria, form and possibilities for the payoff functions, and the benefits of using a quantum strategy. In addition to comparing and contrasting these techniques, new applications and calculations are discussed. Finally, the techniques are expanded into 3 x 3 games which allows the study of non-transitive strategies in quantum games.

•Jan 1, 2002•0 citations

An Investigation of Quantum Computational Game Theory

Scott Ricketts, Max Mintz

Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what

•Jan 1, 2006•0 citations

Best Response Analysis in Two Person Quantum Games

Azharuddin Shaik, Aden Ahmed

In this paper, we find particular use for a maximally entangled initial state that produces a quantized version of two player two strategy games. When applied to a variant of the well-known game of Chicken, our construction shows the existence of new Nash equilibria with the players receiving better payoffs than those found in literature.

Advances in Pure Mathematics•Jan 1, 2014•4 citations

A Note on Special Nash Equilibria of Quantum Games

Yoshitaka Sakagami

This note revisits Sakagami in [1] and studies whether quantum 2 × 2 games with full SU (2) strategy space admit Nash equilibria whose payoff curves do not intersect the classical (no entanglement) payoffs. By allowing duplicate payoffs in each player’s table, we construct an example that yields such “special” equilibria for any entanglement and describe a further equilibrium when there is no entanglement. We also relate the example to strong isomorphism results by Frackiewicz in [2].

Journal of Quantum Information Science•Jan 1, 2025•0 citations
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.
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to Quantumize\textit{Quantumize}Quantumize any finite classical nnn-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.
Non-cooperative quantum games have received much attention recently. This thesis defines and divides current works into two major categories of gaming techniques with close attention paid to Nash equilibria, form and possibilities for the payoff functions, and the benefits of using a quantum strategy. In addition to comparing and contrasting these techniques, new applications and calculations are discussed. Finally, the techniques are expanded into 3 x 3 games which allows the study of non-transitive strategies in quantum games.
Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what