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

IEEE World Conference on Applied Intelligence and Computing (AIC)

Optimizing Quantum Internet Performance: A Game-Theoretic Approach to Quantum Teleportation

Amit Kumar Pani, Swarnabha Kar, Siddhant Saha, Abhishek Kumar, Sujata Swain, Anjan Bandyopadhyay

Published Jul 26, 2025• 0 citations
Publisher

Abstract

Quantum teleportation is a fundamental protocol enabling the transfer of quantum states between remote nodes without physical transmission. As the Quantum Internet evolves, optimizing quantum teleportation becomes crucial due to entanglement degradation, resource constraints, and network efficiency. This paper proposes a game-theoretic framework for managing quantum teleportation by modeling quantum nodes as rational agents competing or cooperating to maximize teleportation fidelity and entanglement utility. We introduce cooperative and non-cooperative game models, analyze Nash equilibrium strategies for teleportation efficiency, and propose a Shapley-value-based entanglement allocation for fair resource distribution. Our system model incorporates graph-theoretic representations of quantum networks, utility functions, and incentive mechanisms to encourage efficient teleportation strategies. A Qiskit-based simulation evaluates teleportation fidelity and resource efficiency, comparing game-theoretic strategies with classical resource allocation methods. Our findings demonstrate that game-theoretic approaches significantly enhance teleportation efficiency, entanglement utilization, and robustness in a dynamic Quantum Internet environment.

DOI
10.1109/aic66080.2025.11212156

Related papers

Dynamic Resource Allocation Using Quantum Algorithm and Game Theoretic Approach

Anjan Bandyopadhyay, Priyanshi Kumari, Debolina Ghosh +3 more

The assignment of resources dynamically is a decisive issue in the new paradigms of computations including cloud, edge, fog computing, and the Internet of Things (IoT). These are heterogeneous resource environments, decentralized control environments, and overload environments that vary at a rapid pace and require adaptive and intelligent allocation schemes. The paper suggests a hybrid quantum-game-theoretic model, which combines quantum optimization approaches and multi-agent game theory to solve the problems of multi-agent resource allocation in dynamic systems. Using the quantum concept of superposition and entanglement, the framework can explore the solution spaces in parallel and therefore increase convergence speed and allocation efficiency.A quantum game-theoretic model is developed, which entails price-motivated system to control the strategic interaction of rational agents, in addition to maintaining stability, autonomy and equilibrium. The resource allocation problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solved with the Quantum Approximate Optimization Algorithm (QAOA) algorithm. The proposed approach is proved to be useful as simulation results show significant gains to classical baselines in terms of utility gain, fairness, and system throughput. The results highlight the possibilities of the quantum-game-theoretic paradigm as a fundamental engine of next-generation computing infrastructures, including networked cloud, edge and IoT with networked computing nodes in VPN-enabled networks.

International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)•Dec 20, 2025•1 citation

Quantum Game Theory-Based Cloud Resource Allocation: A Novel Approach

Anjan Bandyopadhyay, Utkarsh Choudhary, Vaibhav Tiwari +5 more

This paper explores the application of quantum game theory to optimize cloud resource allocation. By leveraging the principles of quantum mechanics, the proposed framework aims to enhance efficiency, reduce costs, and improve scalability in cloud computing environments. The study introduces a quantum-based game-theoretic model and compares its performance with classical approaches. The results demonstrate significant improvements in resource utilization and decision-making efficiency. While prior works have explored classical game theory and auction-based methods, this study is among the first to implement quantum game theory in a practical cloud computing context, propose a resource allocation mechanism that incorporates both fairness and efficiency while leveraging the computational advantages of quantum systems, and highlight the strategic benefits of quantum entanglement in fostering collaboration between competing entities in cloud environments. This work not only addresses the current limitations of resource allocation but also redefines the possibilities for optimization in complex systems, making a substantial contribution to both quantum computing and cloud resource management domains.

Mathematics•Apr 24, 2025•9 citations

Quantum Entanglement-Based Entanglement Redistribution in Quantum Networks

Jincheng Zhang

This paper proposes a novel mechanism for entanglement redistribution within quantum networks, leveraging the principles of quantum entanglement to dynamically manage and optimize the distribution of information entropy. The core concept involves transferring entropy – quantified as quantum entropy – from one node to another within the network via entangled states. This redistribution aims to improve the overall efficiency and performance of quantum communication protocols. We explore the theoretical framework, utilizing concepts from information theory and quantum mechanics, to define the mathematical operations involved. The proposed system addresses the inherent limitations of static entropy distribution in quantum networks, paving the way for adaptive quantum resource allocation and potentially enabling more sophisticated quantum communication strategies. This work lays a foundational understanding for future research in the area of quantum network management and optimization.

•Sep 5, 2026•0 citations

Mitigation of Routing Congestion on Data Networks: A Quantum Game Theory Approach

Agustin Silva, Omar Gustavo Zabaleta, Constancio Miguel Arizmendi

Because of the sustained growth of information and mobile users transmitting a great amount of data packets, modern network performances are being seriously affected by congestion problems. In fact, congestion management is a challenging task that can be roughly summarized as a trade off between transmission latency and cost. In order to contribute to solve the congestion problem on communication networks, a novel framework based on a quantum game model is proposed, where network packets compete selfishly for their fastest route. Simulations show that final network routing and traveling times achieved with the quantum version outperform those obtained with a classical game model with the same options for packet transmission for both. Pareto optimality and Nash equilibrium are studied as well as the influence of simulated and real noise in the quantum protocol. This leads to the opportunity of developing full-stack protocols that may be capable of taking advantage of the quantum properties for optimizing communication systems. Due to its generality, this game approach can be applied both in classical complex networks and in future quantum networks in order to maximize the performance of the quantum internet.

Quantum Reports•Mar 25, 2022•12 citations

Entangled Resource Allocation Algorithm for Quantum Networks

Jincheng Zhang

This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.

•Aug 31, 2026•0 citations

Quantum Game Theory Meets Quantum Networks

Indrakshi Dey, Nicola Marchetti, Marcello Caleffi +1 more

Classical game theory is a powerful tool focusing on optimized resource distribution, allocation, and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between quantum computers, it is imperative and crucial to exploit game theory for addressing challenges such as entanglement distribution and access, routing, topology extraction, and inference. Quantum networks provide the promising opportunity of employing quantum games owing to their inherent capability of generating and sharing quantum states. In addition, quantum games offer enhanced payoffs and winning probabilities, new strategies, and equilibria, which are unimaginable in classical games. Employing quantum game theory to solve fundamental challenges in quantum networks opens a new fundamental research direction necessitating inter-disciplinary efforts. In this article, we introduce a novel game-the-oretical framework for exploiting quantum strategies to solve – as an archetypal example – one of the key functionalities of a quantum network, namely, entanglement distribution. We compare quantum strategies with classical ones by showing the quantum advantages in terms of link fidelity improvement and latency decrease in communication. In the future, we will generalize our game framework to optimize entanglement distribution and access over any quantum network topology. We will also explore how quantum games can be leveraged to address other challenges like routing, optimization of quantum operations, and topology design.

arXiv:2306.08928•IEEE Wireless Communications•Aug 1, 2024•16 citations
Quantum teleportation is a fundamental protocol enabling the transfer of quantum states between remote nodes without physical transmission. As the Quantum Internet evolves, optimizing quantum teleportation becomes crucial due to entanglement degradation, resource constraints, and network efficiency. This paper proposes a game-theoretic framework for managing quantum teleportation by modeling quantum nodes as rational agents competing or cooperating to maximize teleportation fidelity and entanglement utility. We introduce cooperative and non-cooperative game models, analyze Nash equilibrium strategies for teleportation efficiency, and propose a Shapley-value-based entanglement allocation for fair resource distribution. Our system model incorporates graph-theoretic representations of quantum networks, utility functions, and incentive mechanisms to encourage efficient teleportation strategies. A Qiskit-based simulation evaluates teleportation fidelity and resource efficiency, comparing game-theoretic strategies with classical resource allocation methods. Our findings demonstrate that game-theoretic approaches significantly enhance teleportation efficiency, entanglement utilization, and robustness in a dynamic Quantum Internet environment.
The assignment of resources dynamically is a decisive issue in the new paradigms of computations including cloud, edge, fog computing, and the Internet of Things (IoT). These are heterogeneous resource environments, decentralized control environments, and overload environments that vary at a rapid pace and require adaptive and intelligent allocation schemes. The paper suggests a hybrid quantum-game-theoretic model, which combines quantum optimization approaches and multi-agent game theory to solve the problems of multi-agent resource allocation in dynamic systems. Using the quantum concept of superposition and entanglement, the framework can explore the solution spaces in parallel and therefore increase convergence speed and allocation efficiency.A quantum game-theoretic model is developed, which entails price-motivated system to control the strategic interaction of rational agents, in addition to maintaining stability, autonomy and equilibrium. The resource allocation problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solved with the Quantum Approximate Optimization Algorithm (QAOA) algorithm. The proposed approach is proved to be useful as simulation results show significant gains to classical baselines in terms of utility gain, fairness, and system throughput. The results highlight the possibilities of the quantum-game-theoretic paradigm as a fundamental engine of next-generation computing infrastructures, including networked cloud, edge and IoT with networked computing nodes in VPN-enabled networks.
This paper explores the application of quantum game theory to optimize cloud resource allocation. By leveraging the principles of quantum mechanics, the proposed framework aims to enhance efficiency, reduce costs, and improve scalability in cloud computing environments. The study introduces a quantum-based game-theoretic model and compares its performance with classical approaches. The results demonstrate significant improvements in resource utilization and decision-making efficiency. While prior works have explored classical game theory and auction-based methods, this study is among the first to implement quantum game theory in a practical cloud computing context, propose a resource allocation mechanism that incorporates both fairness and efficiency while leveraging the computational advantages of quantum systems, and highlight the strategic benefits of quantum entanglement in fostering collaboration between competing entities in cloud environments. This work not only addresses the current limitations of resource allocation but also redefines the possibilities for optimization in complex systems, making a substantial contribution to both quantum computing and cloud resource management domains.
This paper proposes a novel mechanism for entanglement redistribution within quantum networks, leveraging the principles of quantum entanglement to dynamically manage and optimize the distribution of information entropy. The core concept involves transferring entropy – quantified as quantum entropy – from one node to another within the network via entangled states. This redistribution aims to improve the overall efficiency and performance of quantum communication protocols. We explore the theoretical framework, utilizing concepts from information theory and quantum mechanics, to define the mathematical operations involved. The proposed system addresses the inherent limitations of static entropy distribution in quantum networks, paving the way for adaptive quantum resource allocation and potentially enabling more sophisticated quantum communication strategies. This work lays a foundational understanding for future research in the area of quantum network management and optimization.
Because of the sustained growth of information and mobile users transmitting a great amount of data packets, modern network performances are being seriously affected by congestion problems. In fact, congestion management is a challenging task that can be roughly summarized as a trade off between transmission latency and cost. In order to contribute to solve the congestion problem on communication networks, a novel framework based on a quantum game model is proposed, where network packets compete selfishly for their fastest route. Simulations show that final network routing and traveling times achieved with the quantum version outperform those obtained with a classical game model with the same options for packet transmission for both. Pareto optimality and Nash equilibrium are studied as well as the influence of simulated and real noise in the quantum protocol. This leads to the opportunity of developing full-stack protocols that may be capable of taking advantage of the quantum properties for optimizing communication systems. Due to its generality, this game approach can be applied both in classical complex networks and in future quantum networks in order to maximize the performance of the quantum internet.
This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.
Classical game theory is a powerful tool focusing on optimized resource distribution, allocation, and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between quantum computers, it is imperative and crucial to exploit game theory for addressing challenges such as entanglement distribution and access, routing, topology extraction, and inference. Quantum networks provide the promising opportunity of employing quantum games owing to their inherent capability of generating and sharing quantum states. In addition, quantum games offer enhanced payoffs and winning probabilities, new strategies, and equilibria, which are unimaginable in classical games. Employing quantum game theory to solve fundamental challenges in quantum networks opens a new fundamental research direction necessitating inter-disciplinary efforts. In this article, we introduce a novel game-the-oretical framework for exploiting quantum strategies to solve – as an archetypal example – one of the key functionalities of a quantum network, namely, entanglement distribution. We compare quantum strategies with classical ones by showing the quantum advantages in terms of link fidelity improvement and latency decrease in communication. In the future, we will generalize our game framework to optimize entanglement distribution and access over any quantum network topology. We will also explore how quantum games can be leveraged to address other challenges like routing, optimization of quantum operations, and topology design.