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:2508.09050 · IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)

Bridging Theory and Practice in Quantum Game Theory: Optimized Implementation of the Battle of the Sexes with Error Mitigation on NISQ Hardware

Germán Díaz Agreda, Carlos A. Durán Paredes, Mateo Buenaventura Samboni, Jhon Alejandro Andrade, Sebastián Andrés Cajas

Published Oct 28, 2025• 2 citations
arXivHTMLPDF

Abstract

Implementing quantum game theory on real hardware is challenging due to noise, decoherence, and limited qubit connectivity, yet such demonstrations are essential to validate theoretical predictions. We present one of the first full experimental realizations of the “Battle of the Sexes” game under the Eisert-Wilkens-Lewenstein (EWL) framework on IBM Quantum's ibm_sherbrooke superconducting processor. Four quantum strategies (I, H,$R(\pi / 4), R(\pi)$) were evaluated across 31 entanglement values$\gamma \in[0, \pi]$using 2048 shots per configuration, enabling a direct comparison between analytical predictions and hardware execution. To mitigate noise and variability, we introduce a Guided Circuit Mapping (GCM) method that dynamically selects qubit pairs and optimizes routing based on real-time topology and calibration data. The analytical model forecasts up to 108 % payoff improvement over the classical equilibrium, and despite hardware-induced deviations, experimental results with GCM preserve the expected payoff trends within$3.5 \%-12 \%$relative error. These findings show that quantum advan-tages in strategic coordination can persist under realistic NISQ conditions, providing a pathway toward practical applications of quantum game theory in multi-agent, economic, and distributed decisionmaking systems.

DOI
10.1109/chilecon66915.2025.11476221

Related papers

Experimental Implementation of the Quantum Volunteer's Dilemma on NISQ Hardware: Noise Analysis and Digital-Twin Validation

Germán Díaz Agreda, Jhon Alejandro Andrade Hoyos, Carlos A. Durán Paredes +4 more

Abstract We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy intermediate-scale quantum (NISQ) hardware, executed on the ibm_kingston backend via Qiskit Runtime. The game is evaluated for N = 2 to 9 players under four transpiler optimization levels, with 20 independent repetitions per configuration and 2048 shots per circuit, including post-processing readout error correction via mthree. Target-state fidelity decays with system size but remains above 70% (corrected) through N = 9. With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N ≤ 6 and exceeds the classical Nash equilibrium across the full tested range. Optimization level 2 is selected as the reference configuration after gate count analysis reveals that levels 2 and 3 produce identical transpiled circuits, with level 2 achieving superior fidelity stability. A Hamming distance analysis of raw measurement counts shows that single-qubit errors dominate at small N, with multi-qubit contributions growing beyond N = 6. A calibration-based digital twin captures global payoff trends but exhibits a linear fidelity decay profile that diverges from the hardware behavior at large N, exposing the limits of first-order independent per-qubit noise models. These results demonstrate that aggregate quantum advantage in multiplayer games is robust to NISQ noise conditions across the full tested range, while the practical observability of state-level advantage is constrained to N ≤ 8 under post-processed readout correction.

•Jun 22, 2026•0 citations

Experimental Implementation of the Quantum Volunteer's Dilemma on NISQ Hardware: Noise Analysis and Digital-Twin Validation

Germán D. Díaz Agreda, Jhon Alejandro Andrade Hoyos, Carlos A. Durán Paredes +4 more

We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy intermediate-scale quantum (NISQ) hardware, executed on the ibm_kingston backend via Qiskit Runtime. The game is evaluated for N = 2 to 9 players under four transpiler optimization levels, with 20 independent repetitions per configuration and 2048 shots per circuit, including post-processing readout error correction via mthree. Target-state fidelity decays with system size but remains above 70% (corrected) through N = 9. With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N <= 6 and exceeds the classical Nash equilibrium across the full tested range. Optimization level 2 is selected as the reference configuration after gate count analysis reveals that levels 2 and 3 produce identical transpiled circuits, with level 2 achieving superior fidelity stability. A Hamming distance analysis of raw measurement counts shows that single-qubit errors dominate at small N, with multi-qubit contributions growing beyond N = 6. A calibration-based digital twin captures global payoff trends but exhibits a linear fidelity decay profile that diverges from the hardware behavior at large N, exposing the limits of first-order independent per-qubit noise models. These results demonstrate that aggregate quantum advantage in multiplayer games is robust to NISQ noise conditions across the full tested range, while the practical observability of state-level advantage is constrained to N <= 8 under post-processed readout correction.

quant-pharXiv:2605.30676•Jun 1, 2026•2 citations

Battle of the Sexes: A Quantum Games Theory Approach

J. R.

Real life situations where there are strategies to be chosen in order to obtain a profit can be reproduced by games, so game theory is a way to describe the evolution of possible scenarios where players can select a scheme of play. Game theory takes importance in many areas, such as people decisions making, where their choices do affect others benefit (Davis, 1970; Myerson, 1991). It is to remark that the principles of game theory were initiated by trying to understand the behavior of economic strategies, however Von Neumann presented the concept of modern game theory in 1944 (Von Neumann & Morgenstern, 1947). Quantum mechanics is a tool that creates another point of view for the traditional game theory due to multiple strategies offered for the players, whom possibilities are numerously expanded in contrast of classical ones (Eisert & Wilkens, 2000). There are also games where the player who uses quantum strategies, enhances his payoffs or even always wins against a player who only uses classical moves (Meyer, 1999). It is to remark that there are plenty of applications for quantum game theory such as quantum cryptography and computation, economics and biology (Piotrowski & Sladkowski, 2003; Hanauske et al.,2009). The Battle of the Sexes game is a largely analyzed problem, based on two players: Alice and Bob and their choice about an activity for a Saturday night with each other. It is pretty important to remark that both want the best possible payoff in the decision, so the game can be developed normally, otherwise it would not be our case. Alice, really loves Opera, but wants to be with Bob; Bob likes Football but he wants to have Alice’s company along the activity. This game has a lot of applications in real life scenarios such as the spread of some type of genes from a reproduction between two organisms (Dawkins, 2006); another interesting application is neuroeconomics (Montague & Berns, 2002), where brain studies have been done in order to incite neurons to choose either to “work” for a reward or to “shirk” (Glimcher, 2003).

InTech eBooks•Feb 22, 2012•0 citations

Graph-encoded strategic interactions in multiplayer quantum games

Michael Tsakiroglou, Ioannis Liliopoulos, Georgios D. Varsamis +2 more

Abstract Multiplayer quantum games have received growing attention due to the ability of quantum computational models to access enlarged strategic spaces, thereby enabling the emergence of nonclassical Nash equilibria and Pareto-efficient solutions. Concurrently, graph-theoretic representations have become a standard tool for encoding relational dependencies among interacting players. This work establishes a unified formalism that embeds arbitrary graph topologies into parametrized quantum-game circuits, providing a direct mapping between network structure and the strategic interaction space of quantum players. Within this framework, we analytically and computationally evaluate how graph-induced interpersonal couplings modulate payoff distributions over repeated quantum-game iterations. In addition, we integrate a reward-driven adaptation algorithm that allows players to optimize their local strategy parameters dynamically with respect to accumulated payoffs. Experimental results demonstrate that the equilibrium reward landscape is highly sensitive to the players’ graph-theoretic centrality and the weighted structure of their adversarial and cooperative relationships.

Quantum Information Processing•Mar 23, 2026•1 citation

Parameterized 4-Qubit EWL Quantum Game Circuits with Dirac-Solow-Swan Hamiltonian Integration for Quadruple Helix Disruptive Innovation Recommender Systems

Agung Trisetyarso, Fithra Faisal Hastiadi, Kridanto Surendro

We present a novel parameterized 4-qubit Eisert-Wilkens-Lewenstein (EWL) quantum game circuit for recommender systems in quadruple helix innovation ecosystems (academia, industry, government, and civil society). The local strategy operators $U_{i} = R_y(θ_{i})$ for each helix actor are directly tuned by normalized dominance weights extracted from real participant funding data (\texit{ecContribution}) in the European Commission CORDIS Horizon Europe database (project COVend, ID 101045956). The circuit employs a multi-qubit EWL entangler followed by parameterized local rotations, inverse entangler, and full measurement, achieving only 22 gates and circuit depth 11 while scaling as $O(n)$ for $n$-round helix communications. Measurement probabilities after the quantum game serve as recommender scores for disruptive versus sustaining innovation trends. These scores are subsequently mapped into the diagonal Dirac potential of a Dirac-Solow-Swan Hamiltonian, enabling time-evolution simulation of capital accumulation and bifurcation dynamics under disruptive innovation. Numerical experiments on real CORDIS quadruple-helix collaboration networks demonstrate the circuit's NISQ compatibility and its ability to forecast disruptive capital trajectories with high fidelity. The proposed framework bridges quantum game theory, parameterized quantum circuits, and relativistic economic growth models, offering a computationally efficient tool for innovation policy and strategic decision-making in complex socio-economic ecosystems. Complexity analysis and reproducibility are provided through open Qiskit implementations.

quant-pharXiv:2605.18080•May 19, 2026•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
Implementing quantum game theory on real hardware is challenging due to noise, decoherence, and limited qubit connectivity, yet such demonstrations are essential to validate theoretical predictions. We present one of the first full experimental realizations of the “Battle of the Sexes” game under the Eisert-Wilkens-Lewenstein (EWL) framework on IBM Quantum's ibm_sherbrooke superconducting processor. Four quantum strategies (I, H,R(π/4),R(π)R(\pi / 4), R(\pi)R(π/4),R(π)) were evaluated across 31 entanglement valuesγ∈[0,π]\gamma \in[0, \pi]γ∈[0,π]using 2048 shots per configuration, enabling a direct comparison between analytical predictions and hardware execution. To mitigate noise and variability, we introduce a Guided Circuit Mapping (GCM) method that dynamically selects qubit pairs and optimizes routing based on real-time topology and calibration data. The analytical model forecasts up to 108 % payoff improvement over the classical equilibrium, and despite hardware-induced deviations, experimental results with GCM preserve the expected payoff trends within3.5%−12%3.5 \%-12 \%3.5%−12%relative error. These findings show that quantum advan-tages in strategic coordination can persist under realistic NISQ conditions, providing a pathway toward practical applications of quantum game theory in multi-agent, economic, and distributed decisionmaking systems.
Abstract We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy intermediate-scale quantum (NISQ) hardware, executed on the ibm_kingston backend via Qiskit Runtime. The game is evaluated for N = 2 to 9 players under four transpiler optimization levels, with 20 independent repetitions per configuration and 2048 shots per circuit, including post-processing readout error correction via mthree. Target-state fidelity decays with system size but remains above 70% (corrected) through N = 9. With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N ≤ 6 and exceeds the classical Nash equilibrium across the full tested range. Optimization level 2 is selected as the reference configuration after gate count analysis reveals that levels 2 and 3 produce identical transpiled circuits, with level 2 achieving superior fidelity stability. A Hamming distance analysis of raw measurement counts shows that single-qubit errors dominate at small N, with multi-qubit contributions growing beyond N = 6. A calibration-based digital twin captures global payoff trends but exhibits a linear fidelity decay profile that diverges from the hardware behavior at large N, exposing the limits of first-order independent per-qubit noise models. These results demonstrate that aggregate quantum advantage in multiplayer games is robust to NISQ noise conditions across the full tested range, while the practical observability of state-level advantage is constrained to N ≤ 8 under post-processed readout correction.
We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy intermediate-scale quantum (NISQ) hardware, executed on the ibm_kingston backend via Qiskit Runtime. The game is evaluated for N = 2 to 9 players under four transpiler optimization levels, with 20 independent repetitions per configuration and 2048 shots per circuit, including post-processing readout error correction via mthree. Target-state fidelity decays with system size but remains above 70% (corrected) through N = 9. With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N <= 6 and exceeds the classical Nash equilibrium across the full tested range. Optimization level 2 is selected as the reference configuration after gate count analysis reveals that levels 2 and 3 produce identical transpiled circuits, with level 2 achieving superior fidelity stability. A Hamming distance analysis of raw measurement counts shows that single-qubit errors dominate at small N, with multi-qubit contributions growing beyond N = 6. A calibration-based digital twin captures global payoff trends but exhibits a linear fidelity decay profile that diverges from the hardware behavior at large N, exposing the limits of first-order independent per-qubit noise models. These results demonstrate that aggregate quantum advantage in multiplayer games is robust to NISQ noise conditions across the full tested range, while the practical observability of state-level advantage is constrained to N <= 8 under post-processed readout correction.
Real life situations where there are strategies to be chosen in order to obtain a profit can be reproduced by games, so game theory is a way to describe the evolution of possible scenarios where players can select a scheme of play. Game theory takes importance in many areas, such as people decisions making, where their choices do affect others benefit (Davis, 1970; Myerson, 1991). It is to remark that the principles of game theory were initiated by trying to understand the behavior of economic strategies, however Von Neumann presented the concept of modern game theory in 1944 (Von Neumann & Morgenstern, 1947). Quantum mechanics is a tool that creates another point of view for the traditional game theory due to multiple strategies offered for the players, whom possibilities are numerously expanded in contrast of classical ones (Eisert & Wilkens, 2000). There are also games where the player who uses quantum strategies, enhances his payoffs or even always wins against a player who only uses classical moves (Meyer, 1999). It is to remark that there are plenty of applications for quantum game theory such as quantum cryptography and computation, economics and biology (Piotrowski & Sladkowski, 2003; Hanauske et al.,2009). The Battle of the Sexes game is a largely analyzed problem, based on two players: Alice and Bob and their choice about an activity for a Saturday night with each other. It is pretty important to remark that both want the best possible payoff in the decision, so the game can be developed normally, otherwise it would not be our case. Alice, really loves Opera, but wants to be with Bob; Bob likes Football but he wants to have Alice’s company along the activity. This game has a lot of applications in real life scenarios such as the spread of some type of genes from a reproduction between two organisms (Dawkins, 2006); another interesting application is neuroeconomics (Montague & Berns, 2002), where brain studies have been done in order to incite neurons to choose either to “work” for a reward or to “shirk” (Glimcher, 2003).
Abstract Multiplayer quantum games have received growing attention due to the ability of quantum computational models to access enlarged strategic spaces, thereby enabling the emergence of nonclassical Nash equilibria and Pareto-efficient solutions. Concurrently, graph-theoretic representations have become a standard tool for encoding relational dependencies among interacting players. This work establishes a unified formalism that embeds arbitrary graph topologies into parametrized quantum-game circuits, providing a direct mapping between network structure and the strategic interaction space of quantum players. Within this framework, we analytically and computationally evaluate how graph-induced interpersonal couplings modulate payoff distributions over repeated quantum-game iterations. In addition, we integrate a reward-driven adaptation algorithm that allows players to optimize their local strategy parameters dynamically with respect to accumulated payoffs. Experimental results demonstrate that the equilibrium reward landscape is highly sensitive to the players’ graph-theoretic centrality and the weighted structure of their adversarial and cooperative relationships.
We present a novel parameterized 4-qubit Eisert-Wilkens-Lewenstein (EWL) quantum game circuit for recommender systems in quadruple helix innovation ecosystems (academia, industry, government, and civil society). The local strategy operators Ui=Ry(θi)U_{i} = R_y(θ_{i})Ui​=Ry​(θi​) for each helix actor are directly tuned by normalized dominance weights extracted from real participant funding data (\texit{ecContribution}) in the European Commission CORDIS Horizon Europe database (project COVend, ID 101045956). The circuit employs a multi-qubit EWL entangler followed by parameterized local rotations, inverse entangler, and full measurement, achieving only 22 gates and circuit depth 11 while scaling as O(n)O(n)O(n) for nnn-round helix communications. Measurement probabilities after the quantum game serve as recommender scores for disruptive versus sustaining innovation trends. These scores are subsequently mapped into the diagonal Dirac potential of a Dirac-Solow-Swan Hamiltonian, enabling time-evolution simulation of capital accumulation and bifurcation dynamics under disruptive innovation. Numerical experiments on real CORDIS quadruple-helix collaboration networks demonstrate the circuit's NISQ compatibility and its ability to forecast disruptive capital trajectories with high fidelity. The proposed framework bridges quantum game theory, parameterized quantum circuits, and relativistic economic growth models, offering a computationally efficient tool for innovation policy and strategic decision-making in complex socio-economic ecosystems. Complexity analysis and reproducibility are provided through open Qiskit implementations.
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.