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

Quantum Keynesian Beauty Contest with Continuous Variables

Hiu Ming Lau, Kareem Raslan, Kieran Hymas, Qiang Sun, Azhar Iqbal, Derek Abbott, James Q. Quach, Andrew D. Greentree

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

Abstract

The development of quantum computing has opened up opportunities to re-explore conventional game models by the integration of quantum processes. Through the established framework of quantum game theory, we examine the problem of speculative pricing in the Keynesian Beauty Contest model -- the $p$-Beauty Contest ($p$-BC). In the $p$-BC, players are rewarded with the optimal payoff for successfully bidding at some fraction $p$ of the average of all of the players' bids. Consequently, \textit{rational} plays in the $p$-BC inexorably lead to boom or bust strategies for $p>1$ or $p<1$ respectively. We demonstrate a quantum continuous-variable implementation of $p$-BC where the boom-and-bust rational behavior is mitigated through a global transformation of the players' bids generated by increasing multimode squeezing. While we focus on a quantum mechanical implementation of the $p$-BC, we show that an entirely analogous game can be formulated via classical channels by a global mediator. Thus we identify global mediation as the underlying game-theoretic mechanism for quenching boom and bust phenomena in our model. We analyze the quantum $p$-BC for two, three, and many players in a mean-field type implementation. We derive an analytical form for the probability distribution of the payoff under single-value measurements of the quantum processing circuit, and explore how the rational behavior differs from the expected-value measurement setting.

DOI
10.48550/arxiv.2611.16829

Related papers

Quenching Speculation in Quantum Markets via Entangled Neural Traders

Kieran Hymas, Hiu Ming Lau, Kareem Raslan +5 more

Speculative trading can drive pronounced market instabilities, yet existing regulatory and macroprudential tools intervene only after such dynamics emerge. Quantum technologies offer a fundamentally new means of shaping economic behavior by introducing non-classical correlations between decision-makers. Here we demonstrate a prototype quantum stock market in which entanglement between traders' valuations mitigates the runaway devaluation characteristic of speculative busts. Using reinforcement-learning agents trading a single commodity, we show that replacing classical valuations with quantum-correlated qubit-encoded valuations stabilizes prices and increases the AI traders' net worth relative to a classical market, where instead agents rapidly converge to liquidation strategies that collapse the asset value. To explain this behavior, we formulate and analyze a quantized version of the $p$-guessing game, a canonical model of speculative dynamics. Quantum entanglement and phase coherence reshape the strategic landscape, eliminating the pathological pure-strategy Nash equilibrium that drives market collapse in the classical game, while mixed-strategy equilibria remain non-degenerate and avoid bust-type outcomes. These results identify quantum correlations as a novel, endogenous mechanism for market stabilization and, more broadly, demonstrate the utility of multi-agent reinforcement learning algorithms for uncovering optimal strategies in complex decision-making frameworks with quantum degrees of freedom.

quant-pharXiv:2602.06367•Feb 9, 2026•1 citation

Quantum volunteer's dilemma

Dax Enshan Koh, Kaavya Kumar, Siong Thye Goh

The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work we introduce a quantum variant of the classical volunteer's dilemma, generalizing it by allowing players to utilize quantum strategies. Employing the Eisert-Wilkens-Lewenstein quantization framework, we analyze a multiplayer quantum volunteer's dilemma scenario with an arbitrary number of players, where the cost of volunteering is shared equally among the volunteers. We derive analytical expressions for the players' expected payoffs and demonstrate the quantum game's advantage over the classical game. In particular, we prove that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs compared to the unique symmetric Nash equilibrium of the classical game, wherein players use mixed strategies. Furthermore, we show that the quantum Nash equilibria we identify are Pareto optimal. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules, underscoring a strategic advantage of decision making in quantum settings.

arXiv:2409.05708•Physical Review Research•Jan 27, 2025•17 citations

Quantum-Optical set-up for the Monty Hall problem

Luis Fernando Quezada, A. Martín-Ruiz, Adam Frank +1 more

Abstract A quantum version of the Monty Hall problem is proposed inspired by an experimentally-feasible, quantum-optical set-up that resembles the classical game. The expected payoff of the player is studied by analyzing the classical expectation values of the obtained quantum probabilities. Results are examined by considering both entanglement and non-entanglement between player and host, and using two different approaches: random and strategy-based. We also discuss the influence of noise on the game outcome when the parties play through a noisy quantum channel. The experimental set-up can be used to quickly verify the counter-intuitive result of the Monty Hall problem, adding pedagogic value to the proposal.

arXiv:1908.05774•Physica Scripta•Apr 2, 2020•5 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

Dynamics of a quantum Cournot-Bertrand duopoly model based on bounded rationality and product substitutability

Yu-Chung Chang

The development of quantum information theory based on quantum entangled states is advancing rapidly and has promoted the emergence of quantum game theory. Quantum game theory is quantum information processing applied to classical games, which solves problems that classical games cannot solve. This paper explores the quantum Cournot-Bertrand game model of two firms in a duopoly market with bounded rationality and product substitutability. The first and second firms choose production output and sales price as their decision variables, respectively. We first define the quantum Cournot-Bertrand dynamical system and study the existence and locally stable conditions of equilibrium points. Then we explore bifurcation conditions and bifurcation types. Finally, we do the bifurcation analysis and explore the impacts of the model parameters as the potential market size of products, the two firms' linear marginal cost, the players' speed of strategy adjustment, the product substitution index, and the quantum entanglement degree on the Nash equilibrium stability and bifurcation using numerical analysis and simulation, and provide economic explanations for the results.

Quantum Information Processing•Jul 9, 2025•7 citations

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
The development of quantum computing has opened up opportunities to re-explore conventional game models by the integration of quantum processes. Through the established framework of quantum game theory, we examine the problem of speculative pricing in the Keynesian Beauty Contest model -- the ppp-Beauty Contest (ppp-BC). In the ppp-BC, players are rewarded with the optimal payoff for successfully bidding at some fraction ppp of the average of all of the players' bids. Consequently, \textit{rational} plays in the ppp-BC inexorably lead to boom or bust strategies for p>1p>1p>1 or p<1p<1p<1 respectively. We demonstrate a quantum continuous-variable implementation of ppp-BC where the boom-and-bust rational behavior is mitigated through a global transformation of the players' bids generated by increasing multimode squeezing. While we focus on a quantum mechanical implementation of the ppp-BC, we show that an entirely analogous game can be formulated via classical channels by a global mediator. Thus we identify global mediation as the underlying game-theoretic mechanism for quenching boom and bust phenomena in our model. We analyze the quantum ppp-BC for two, three, and many players in a mean-field type implementation. We derive an analytical form for the probability distribution of the payoff under single-value measurements of the quantum processing circuit, and explore how the rational behavior differs from the expected-value measurement setting.
Speculative trading can drive pronounced market instabilities, yet existing regulatory and macroprudential tools intervene only after such dynamics emerge. Quantum technologies offer a fundamentally new means of shaping economic behavior by introducing non-classical correlations between decision-makers. Here we demonstrate a prototype quantum stock market in which entanglement between traders' valuations mitigates the runaway devaluation characteristic of speculative busts. Using reinforcement-learning agents trading a single commodity, we show that replacing classical valuations with quantum-correlated qubit-encoded valuations stabilizes prices and increases the AI traders' net worth relative to a classical market, where instead agents rapidly converge to liquidation strategies that collapse the asset value. To explain this behavior, we formulate and analyze a quantized version of the ppp-guessing game, a canonical model of speculative dynamics. Quantum entanglement and phase coherence reshape the strategic landscape, eliminating the pathological pure-strategy Nash equilibrium that drives market collapse in the classical game, while mixed-strategy equilibria remain non-degenerate and avoid bust-type outcomes. These results identify quantum correlations as a novel, endogenous mechanism for market stabilization and, more broadly, demonstrate the utility of multi-agent reinforcement learning algorithms for uncovering optimal strategies in complex decision-making frameworks with quantum degrees of freedom.
The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work we introduce a quantum variant of the classical volunteer's dilemma, generalizing it by allowing players to utilize quantum strategies. Employing the Eisert-Wilkens-Lewenstein quantization framework, we analyze a multiplayer quantum volunteer's dilemma scenario with an arbitrary number of players, where the cost of volunteering is shared equally among the volunteers. We derive analytical expressions for the players' expected payoffs and demonstrate the quantum game's advantage over the classical game. In particular, we prove that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs compared to the unique symmetric Nash equilibrium of the classical game, wherein players use mixed strategies. Furthermore, we show that the quantum Nash equilibria we identify are Pareto optimal. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules, underscoring a strategic advantage of decision making in quantum settings.
Abstract A quantum version of the Monty Hall problem is proposed inspired by an experimentally-feasible, quantum-optical set-up that resembles the classical game. The expected payoff of the player is studied by analyzing the classical expectation values of the obtained quantum probabilities. Results are examined by considering both entanglement and non-entanglement between player and host, and using two different approaches: random and strategy-based. We also discuss the influence of noise on the game outcome when the parties play through a noisy quantum channel. The experimental set-up can be used to quickly verify the counter-intuitive result of the Monty Hall problem, adding pedagogic value to the proposal.
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
The development of quantum information theory based on quantum entangled states is advancing rapidly and has promoted the emergence of quantum game theory. Quantum game theory is quantum information processing applied to classical games, which solves problems that classical games cannot solve. This paper explores the quantum Cournot-Bertrand game model of two firms in a duopoly market with bounded rationality and product substitutability. The first and second firms choose production output and sales price as their decision variables, respectively. We first define the quantum Cournot-Bertrand dynamical system and study the existence and locally stable conditions of equilibrium points. Then we explore bifurcation conditions and bifurcation types. Finally, we do the bifurcation analysis and explore the impacts of the model parameters as the potential market size of products, the two firms' linear marginal cost, the players' speed of strategy adjustment, the product substitution index, and the quantum entanglement degree on the Nash equilibrium stability and bifurcation using numerical analysis and simulation, and provide economic explanations for the results.
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.