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:quant-ph/0301013

A Practical Quantum Mechanism for the Public Goods Game

Kay‐Yut Chen, Tad Hogg, Raymond G. Beausoleil

Published Jan 6, 2003• 12 citations
arXivHTMLPDF

Abstract

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is difficult to implement, especially if the states must be communicated over some distance. This paper describes a quantum mechanism for the economically significant $n$-player public goods game that requires only two-particle entanglement and is thus much easier to implement than more general quantum mechanisms. In spite of the large temptation to free ride on the efforts of others in this game, two-particle entanglement is sufficient to give near optimal expected payoff when players use a simple mixed strategy for which no player can benefit by making different choices. This mechanism can also address some heterogeneous preferences among the players.

DOI
10.48550/arxiv.quant-ph/0301013

Related papers

REDUCED ENTANGLEMENT FOR QUANTUM GAMES

LI ZHANG, Tad Hogg

Quantum generalizations of conventional games exploit entangled states to improve performance. With many players, quantum games can require entangling many states. Such entanglement is difficult to implement, especially if the states must be communicated over some distance. To simplify possible implementations, we examine some quantum versions of social dilemma games and show their use of entanglement can be substantially reduced by randomly replacing some of the entangled states by unentangled ones. For the example of public goods games, we identify a unique Nash equilibrium invariant with respect to the amount of this replacement. We also show players obtain no advantage from adding more entanglement to states which they control. With many players, a fairly small number of entangled states can give nearly as good performance as using the full number of such states.

International Journal of Quantum Information•Sep 1, 2003•3 citations

A necessary and sufficient condition to play games in quantum mechanical settings

Şahin Kaya Özdemir, Junichi Shimamura, N. Imoto

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

arXiv:quant-ph/0508105•New Journal of Physics•Feb 28, 2007•59 citations

How Quantum Entanglement Helps to Coordinate Non-Communicating Players

G.V. Klimovitch

We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each player changes according to external conditions and is not known to the other players. In one example of such a game, quantum entanglement between players results in the optimal payoff thrice the maximal payoff for unentangled players.

arXiv:quant-ph/0405093•May 17, 2004•3 citations

Research on Repeated Quantum Games with Public Goods under Strong Reciprocity

Simo Sun, Yadong Shu, Jinxiu Pi +1 more

We developed a repeated quantum game of public goods by using quantum entanglement and strong reciprocity mechanisms. Utilizing the framework of quantum game analysis, a comparative investigation incorporating both entangled and non-entangled states reveals that the player will choose a fully cooperative strategy when the expected cooperation strategy of the competitor exceeds a certain threshold. When the entanglement of states is not considered, the prisoner’s dilemma still exists, and the cooperating party must bear the cost of defactoring the quantum strategy themselves; when considering the entanglement of states, the benefits of both parties in the game are closely related, forming a community of benefits. By signing a strong reciprocity contract, the degree of cooperation between the game parties can be considered using the strong reciprocity entanglement contract mechanism. The party striving to cooperate does not have to bear the risk of the other party’s defector, and to some extent, it can solve the prisoner’s dilemma problem. Finally, taking the public goods green planting industry project as an example, by jointly entrusting a third party to determine and sign a strong reciprocity entanglement contract, both parties can ensure a complete quantum strategy to maximize cooperation and achieve Pareto optimality, ultimately enabling the long-term and stable development of the public goods industry project.

Axioms•Nov 10, 2023•0 citations

Proxy Quantum Games

Georgios D. Varsamis, Ioannis Liliopoulos, Hamed Mohammadbagherpoor +6 more

Quantum games extend classical game theory into the quantum realm by incorporating quantum players and quantum strategies. Two-player quantum games have been widely studied and applied, among other areas, in optimization and decision-making. In this work, we introduce, formalize and analyze a novel class of three-player quantum games, referred to as Proxy Quantum Games (PQGs). In this setting, one player, the Controller, influences or governs the strategic operations executed by a second player, the Proxy, who, in turn, competes directly against a third player, the Opponent. The strategic influence is implemented via controlled unitary operations, whereby the Proxy’s available strategies are conditioned on the Controller’s quantum state. We further generalize the PQG framework by incorporating multiple Controllers acting on a common Proxy, thereby enabling the study of higher-order strategic interactions and multi-agent influence structures. The objective under consideration is the maximization of the Controller’s expected payoff, under various configurations of strategic control and entanglement. Comparative analyses are conducted between the PQG formulation and conventional multiplayer quantum games, highlighting key differences in strategic behavior and payoff distributions.

Parallel Processing Letters•Sep 1, 2025•1 citation

A Statistically Robust Analysis of the N-Player Quantum Public Goods Game on a Calibrated Noise Model

Kartikeyan Premkumar, K Soveet Kumar Prusty, Shweta S. Aladakatti +1 more

This paper investigates the strategic implications of quantum mechanics on the N-Player Public Goods Game (PGG), a canonical model for the "Tragedy of the Commons." Classically, the PGG is dominated by a single, socially suboptimal Nash Equilibrium where all players 'defect' (free ride), leading to a collective loss. We investigate whether quantum strategies, specifically those that utilize multi-particle entanglement, can overcome this problem. We construct and evaluate three different strategies—a classical 'All Defect' benchmark, an 'Independent Quantum' strategy using superposition, and a 'Coordinated Quantum' strategy using an N-qubit entangled state—for N = 4 and N=5 player games and different pot multipliers (m = 1. 5, 2. 0). These techniques are run on a noise model calibrated to the IBM ibmq_manila quantum device, giving an honest estimate of performance on near-term hardware. Methodologically, we use repeated simulation for statistical robustness, reporting numbers with 95% confidence intervals. Our results exhibit a deep and statistically significant quantum benefit: the entangled approach systematically forms a cooperative Quantum Nash Equilibrium that achieves almost optimal payoffs, far surpassing the classical and independent quantum methods. Nevertheless, an extensive examination of the noise mechanisms at play shows that the scalability of this quantum solution is inherently limited in the Noisy Intermediate-Scale Quantum (NISQ) era. The interaction between error accumulation in the CNOT cascade needed for state preparation and the intrinsic decoherence of the entangled GHZ state produces an escalating failure mechanism that puts a bound on the realizable size of the game. This paper thereby offers both evidence of quantum advantage over a social dilemma and a realistic appraisal of the hardware-dictated constraints that will have to be overcome before such solutions are scalable.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is difficult to implement, especially if the states must be communicated over some distance. This paper describes a quantum mechanism for the economically significant nnn-player public goods game that requires only two-particle entanglement and is thus much easier to implement than more general quantum mechanisms. In spite of the large temptation to free ride on the efforts of others in this game, two-particle entanglement is sufficient to give near optimal expected payoff when players use a simple mixed strategy for which no player can benefit by making different choices. This mechanism can also address some heterogeneous preferences among the players.
Quantum generalizations of conventional games exploit entangled states to improve performance. With many players, quantum games can require entangling many states. Such entanglement is difficult to implement, especially if the states must be communicated over some distance. To simplify possible implementations, we examine some quantum versions of social dilemma games and show their use of entanglement can be substantially reduced by randomly replacing some of the entangled states by unentangled ones. For the example of public goods games, we identify a unique Nash equilibrium invariant with respect to the amount of this replacement. We also show players obtain no advantage from adding more entanglement to states which they control. With many players, a fairly small number of entangled states can give nearly as good performance as using the full number of such states.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
We developed a repeated quantum game of public goods by using quantum entanglement and strong reciprocity mechanisms. Utilizing the framework of quantum game analysis, a comparative investigation incorporating both entangled and non-entangled states reveals that the player will choose a fully cooperative strategy when the expected cooperation strategy of the competitor exceeds a certain threshold. When the entanglement of states is not considered, the prisoner’s dilemma still exists, and the cooperating party must bear the cost of defactoring the quantum strategy themselves; when considering the entanglement of states, the benefits of both parties in the game are closely related, forming a community of benefits. By signing a strong reciprocity contract, the degree of cooperation between the game parties can be considered using the strong reciprocity entanglement contract mechanism. The party striving to cooperate does not have to bear the risk of the other party’s defector, and to some extent, it can solve the prisoner’s dilemma problem. Finally, taking the public goods green planting industry project as an example, by jointly entrusting a third party to determine and sign a strong reciprocity entanglement contract, both parties can ensure a complete quantum strategy to maximize cooperation and achieve Pareto optimality, ultimately enabling the long-term and stable development of the public goods industry project.
Quantum games extend classical game theory into the quantum realm by incorporating quantum players and quantum strategies. Two-player quantum games have been widely studied and applied, among other areas, in optimization and decision-making. In this work, we introduce, formalize and analyze a novel class of three-player quantum games, referred to as Proxy Quantum Games (PQGs). In this setting, one player, the Controller, influences or governs the strategic operations executed by a second player, the Proxy, who, in turn, competes directly against a third player, the Opponent. The strategic influence is implemented via controlled unitary operations, whereby the Proxy’s available strategies are conditioned on the Controller’s quantum state. We further generalize the PQG framework by incorporating multiple Controllers acting on a common Proxy, thereby enabling the study of higher-order strategic interactions and multi-agent influence structures. The objective under consideration is the maximization of the Controller’s expected payoff, under various configurations of strategic control and entanglement. Comparative analyses are conducted between the PQG formulation and conventional multiplayer quantum games, highlighting key differences in strategic behavior and payoff distributions.
This paper investigates the strategic implications of quantum mechanics on the N-Player Public Goods Game (PGG), a canonical model for the "Tragedy of the Commons." Classically, the PGG is dominated by a single, socially suboptimal Nash Equilibrium where all players 'defect' (free ride), leading to a collective loss. We investigate whether quantum strategies, specifically those that utilize multi-particle entanglement, can overcome this problem. We construct and evaluate three different strategies—a classical 'All Defect' benchmark, an 'Independent Quantum' strategy using superposition, and a 'Coordinated Quantum' strategy using an N-qubit entangled state—for N = 4 and N=5 player games and different pot multipliers (m = 1. 5, 2. 0). These techniques are run on a noise model calibrated to the IBM ibmq_manila quantum device, giving an honest estimate of performance on near-term hardware. Methodologically, we use repeated simulation for statistical robustness, reporting numbers with 95% confidence intervals. Our results exhibit a deep and statistically significant quantum benefit: the entangled approach systematically forms a cooperative Quantum Nash Equilibrium that achieves almost optimal payoffs, far surpassing the classical and independent quantum methods. Nevertheless, an extensive examination of the noise mechanisms at play shows that the scalability of this quantum solution is inherently limited in the Noisy Intermediate-Scale Quantum (NISQ) era. The interaction between error accumulation in the CNOT cascade needed for state preparation and the intrinsic decoherence of the entangled GHZ state produces an escalating failure mechanism that puts a bound on the realizable size of the game. This paper thereby offers both evidence of quantum advantage over a social dilemma and a realistic appraisal of the hardware-dictated constraints that will have to be overcome before such solutions are scalable.