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

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

quant-phcond-mat.stat-mechcs.AIecon.EMecon.THSubmitted May 18, 2026• Announced May 19, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
Submitted to Quantum

Related papers

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 +2 more

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.

arXiv:2508.09050•IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)•Oct 28, 2025•2 citations

Quantum Game-Theoretic Optimization with Ramanujan-Inspired Regularization for AI-Driven Supply Chain Resilience

Palanivel R

Abstract Supply chains face increasingly frequent and severe disruptions, while the strategic interactions among suppliers, manufacturers, logistics providers and retailers are traditionally modelled with classical, non-cooperative game theory that struggles to capture correlated, non-classical strategic correlations and scales poorly on the combinatorial optimization problems that resilience investment decisions induce. This paper proposes an integrated \emph{Quantum Game-Theoretic Optimization} framework for resilient supply chains under AI-driven disruption management. The framework combines (i) an Eisert--Wilkens--Lewenstein (EWL) quantum game formulation of the four-agent resilience-investment game, (ii) a Quantum Approximate Optimization Algorithm (QAOA) solver for the resulting resilience-allocation QUBO, augmented with a novel \emph{Ramanujan-inspired regularization} term built from the Hardy--Ramanujan partition asymptotic and Ramanujan summation (zeta-regularization), and (iii) a multi-agent reinforcement learning (MARL) layer whose learning-rate schedule is modulated by the Rogers--Ramanujan continued fraction. We formally derive the entangled state evolution, the Ising/QUBO mapping, the QAOA cost and mixer Hamiltonians, the Ramanujan regularization term, and the MARL update rule, and we present a five-layer reference system architecture. Using exact statevector simulation (no physical quantum hardware required), we address five research questions spanning equilibrium payoffs under entanglement, QAOA depth scaling, the effect of Ramanujan regularization on optimization-landscape stability, MARL performance under varying disruption severity, and an overall multi-metric benchmark against classical game theory, classical mixed-integer programming, and classical MARL baselines. Simulation results show that entanglement can raise total equilibrium payoff substantially above the classical (product-state) Nash equilibrium by escaping mutually-defecting ''no-investment'' traps, that QAOA approximation ratio improves with circuit depth up to a problem-dependent saturation point, that Ramanujan regularization yields a smoother but instance-dependent optimization landscape, and that the integrated framework achieves the highest service level and robustness score among five compared methods, at a moderate convergence-time cost. Complete derivations, a reproducible open-source Python implementation, and all simulation data are provided.

•Oct 8, 2026•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

Quantum Computing and Entrepreneurial Innovation: Opportunities, Disruption, and Ethics

Eslem Güngör

Quantum computing is emerging as a transformative general-purpose technology with the potential to redefine entrepreneurial innovation across data-intensive and optimization-driven industries. By exploiting quantum mechanical principles such as superposition, entanglement, and quantum parallelism, quantum computers offer new computational capabilities that may surpass classical systems in solving complex problems. This paper examines quantum computing as a catalyst for entrepreneurial innovation, focusing on the strategic opportunities, market disruptions, and ethical challenges associated with quantum-enabled business models in finance, supply chain optimization, and healthcare startups. Through a cross-sectoral analysis, the study explores how startups can leverage hybrid quantum–classical approaches to accelerate decision-making, enhance predictive accuracy, and unlock novel value propositions. At the same time, it addresses critical concerns related to technological uncertainty, unequal access, data security, and responsible innovation. The paper argues that while quantum computing presents significant disruptive potential, its sustainable integration into entrepreneurial ecosystems requires strategic foresight and ethical governance frameworks alongside technological adoption.

Human computer interaction.•Dec 29, 2025•0 citations

Game, Set, Quantum: Parameterized Quantum Circuit for Correlated Equilibrium in Bayesian Games

Param Pathak, Vidhi Oad, Nouhaila Innan +2 more

Strategic decision-making among many agents under incomplete information is central to economics, security, and multi-agent artificial intelligence (AI). Computing equilibria in such settings is challenging because the joint type-action space grows exponentially with the number of players. In binary-type, binary-action Bayesian games with $n$ players, an explicit representation over type-action profiles requires $O(2^{2n})$ entries, making direct linear-programming (LP) formulations increasingly costly as $n$ grows. We propose a hybrid quantum-classical framework for approximating Bayes correlated equilibrium (BCE) using a parameterized quantum circuit (PQC). The PQC represents the conditional distribution over joint actions using $O(nL)$ trainable parameters, where $L$ denotes the circuit depth; for the largest trained setting, $n=8$ and $L=2$, this corresponds to $48$ trainable angles. Each player count is trained independently by maximizing expected social welfare with a penalty on positive aggregated BCE obedience violations. On a strategically coupled Bayesian congestion game with $n=2,4,6,8$ players, feasible PQC solutions attain higher welfare than MCCFR and DCFR product-strategy baselines while satisfying $ε_{\max}\leq10^{-3}$, where $ε_{\max}$ denotes the maximum positive aggregated BCE obedience violation. Across five independent runs per setting, all runs are feasible for $n=2,4,6$, while four of five are feasible for $n=8$. PQC welfare remains below the exact LP optimum, with the absolute gap increasing with $n$, while classical state-vector simulation prevents PQC training beyond eight players. These results demonstrate the use of a compact PQC parameterization for approximate equilibrium computation and quantify its welfare, feasibility, and classical simulation scaling on the studied benchmark.

quant-pharXiv:2606.03109•Jun 3, 2026•0 citations

Optimizing Hybrid Quantum-Classical Models Using Parameterized Quantum Circuits for Time-Series Forecasting

Harshraj Bhoite

Time-series forecasting is vital across sectors such as finance, energy, and environmental science, where accurate future predictions drive informed decision-making. Traditional statistical methods and deep learning models like LSTM and Transformers, while effective, often struggle with high-dimensional data and long-term dependencies. In this paper, we propose a hybrid quantum-classical model that utilizes Parameterized Quantum Circuits (PQCs) to capture complex temporal patterns in multivariate time-series data. Our architecture integrates a classical encoder, a quantum variational processor, and a classical decoder, trained end-to-end using gradient-based optimization. Experiments conducted on benchmark datasets—electricity load, stock prices, and weather forecasting—demonstrate that the hybrid model consistently outperforms classical baselines in terms of Mean Squared Error (MSE), Mean Absolute Error (MAE), and R² score. Robustness analysis confirms the model’s resilience to moderate quantum noise, while an ablation study highlights the performance gain from quantum components. This work showcases the potential of hybrid quantum-classical approaches on Noisy Intermediate-Scale Quantum (NISQ) devices and lays a foundation for scalable, real-world quantum machine learning applications.

•Jul 19, 2025•0 citations
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.
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 Supply chains face increasingly frequent and severe disruptions, while the strategic interactions among suppliers, manufacturers, logistics providers and retailers are traditionally modelled with classical, non-cooperative game theory that struggles to capture correlated, non-classical strategic correlations and scales poorly on the combinatorial optimization problems that resilience investment decisions induce. This paper proposes an integrated \emph{Quantum Game-Theoretic Optimization} framework for resilient supply chains under AI-driven disruption management. The framework combines (i) an Eisert--Wilkens--Lewenstein (EWL) quantum game formulation of the four-agent resilience-investment game, (ii) a Quantum Approximate Optimization Algorithm (QAOA) solver for the resulting resilience-allocation QUBO, augmented with a novel \emph{Ramanujan-inspired regularization} term built from the Hardy--Ramanujan partition asymptotic and Ramanujan summation (zeta-regularization), and (iii) a multi-agent reinforcement learning (MARL) layer whose learning-rate schedule is modulated by the Rogers--Ramanujan continued fraction. We formally derive the entangled state evolution, the Ising/QUBO mapping, the QAOA cost and mixer Hamiltonians, the Ramanujan regularization term, and the MARL update rule, and we present a five-layer reference system architecture. Using exact statevector simulation (no physical quantum hardware required), we address five research questions spanning equilibrium payoffs under entanglement, QAOA depth scaling, the effect of Ramanujan regularization on optimization-landscape stability, MARL performance under varying disruption severity, and an overall multi-metric benchmark against classical game theory, classical mixed-integer programming, and classical MARL baselines. Simulation results show that entanglement can raise total equilibrium payoff substantially above the classical (product-state) Nash equilibrium by escaping mutually-defecting ''no-investment'' traps, that QAOA approximation ratio improves with circuit depth up to a problem-dependent saturation point, that Ramanujan regularization yields a smoother but instance-dependent optimization landscape, and that the integrated framework achieves the highest service level and robustness score among five compared methods, at a moderate convergence-time cost. Complete derivations, a reproducible open-source Python implementation, and all simulation data are provided.
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 computing is emerging as a transformative general-purpose technology with the potential to redefine entrepreneurial innovation across data-intensive and optimization-driven industries. By exploiting quantum mechanical principles such as superposition, entanglement, and quantum parallelism, quantum computers offer new computational capabilities that may surpass classical systems in solving complex problems. This paper examines quantum computing as a catalyst for entrepreneurial innovation, focusing on the strategic opportunities, market disruptions, and ethical challenges associated with quantum-enabled business models in finance, supply chain optimization, and healthcare startups. Through a cross-sectoral analysis, the study explores how startups can leverage hybrid quantum–classical approaches to accelerate decision-making, enhance predictive accuracy, and unlock novel value propositions. At the same time, it addresses critical concerns related to technological uncertainty, unequal access, data security, and responsible innovation. The paper argues that while quantum computing presents significant disruptive potential, its sustainable integration into entrepreneurial ecosystems requires strategic foresight and ethical governance frameworks alongside technological adoption.
Strategic decision-making among many agents under incomplete information is central to economics, security, and multi-agent artificial intelligence (AI). Computing equilibria in such settings is challenging because the joint type-action space grows exponentially with the number of players. In binary-type, binary-action Bayesian games with nnn players, an explicit representation over type-action profiles requires O(22n)O(2^{2n})O(22n) entries, making direct linear-programming (LP) formulations increasingly costly as nnn grows. We propose a hybrid quantum-classical framework for approximating Bayes correlated equilibrium (BCE) using a parameterized quantum circuit (PQC). The PQC represents the conditional distribution over joint actions using O(nL)O(nL)O(nL) trainable parameters, where LLL denotes the circuit depth; for the largest trained setting, n=8n=8n=8 and L=2L=2L=2, this corresponds to 484848 trainable angles. Each player count is trained independently by maximizing expected social welfare with a penalty on positive aggregated BCE obedience violations. On a strategically coupled Bayesian congestion game with n=2,4,6,8n=2,4,6,8n=2,4,6,8 players, feasible PQC solutions attain higher welfare than MCCFR and DCFR product-strategy baselines while satisfying εmax⁡≤10−3ε_{\max}\leq10^{-3}εmax​≤10−3, where εmax⁡ε_{\max}εmax​ denotes the maximum positive aggregated BCE obedience violation. Across five independent runs per setting, all runs are feasible for n=2,4,6n=2,4,6n=2,4,6, while four of five are feasible for n=8n=8n=8. PQC welfare remains below the exact LP optimum, with the absolute gap increasing with nnn, while classical state-vector simulation prevents PQC training beyond eight players. These results demonstrate the use of a compact PQC parameterization for approximate equilibrium computation and quantify its welfare, feasibility, and classical simulation scaling on the studied benchmark.
Time-series forecasting is vital across sectors such as finance, energy, and environmental science, where accurate future predictions drive informed decision-making. Traditional statistical methods and deep learning models like LSTM and Transformers, while effective, often struggle with high-dimensional data and long-term dependencies. In this paper, we propose a hybrid quantum-classical model that utilizes Parameterized Quantum Circuits (PQCs) to capture complex temporal patterns in multivariate time-series data. Our architecture integrates a classical encoder, a quantum variational processor, and a classical decoder, trained end-to-end using gradient-based optimization. Experiments conducted on benchmark datasets—electricity load, stock prices, and weather forecasting—demonstrate that the hybrid model consistently outperforms classical baselines in terms of Mean Squared Error (MSE), Mean Absolute Error (MAE), and R² score. Robustness analysis confirms the model’s resilience to moderate quantum noise, while an ablation study highlights the performance gain from quantum components. This work showcases the potential of hybrid quantum-classical approaches on Noisy Intermediate-Scale Quantum (NISQ) devices and lays a foundation for scalable, real-world quantum machine learning applications.