© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IEEE Systems Journal

Analysis of Adversarial Jamming From a Quantum Game Theoretic Perspective

Shantom Kumar Borah, Shivansh Anand, Rishabh Vipul Agarwal, Sainath Bitragunta

Published Jul 7, 2022• 3 citations

Abstract

Over recent years, quantum communication systems have demarcated themselves as promising candidates for deployment in next-generation communication networks (6G and beyond). Several recent experimental demonstrations of such complex systems have been highly successful and have been instrumental in transitioning this field from the theoretical to the practical domain. In this article, we investigate the application of quantum game theory for the modeling and analysis of jamming in the context of quantum networks. We begin with a general model of jamming based on the Colonel Blotto game and generalize it to the context of quantum networks. We provide an in-depth analysis of the two-person quantum Colonel Blotto game (QCBG) in relation to classical versus classical, classical versus quantum, and quantum versus quantum strategies. We also investigate the Nash equilibria for such games via a multiagent adversarial reinforcement learning-based system. Finally, we discuss further optimizations on this model and outline several open problems for further research along these lines.

DOI: 10.1109/jsyst.2022.3184297

Related papers

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

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 game theory

Michael L. Stohler

Non-cooperative quantum games have received much attention recently. This thesis defines and divides current works into two major categories of gaming techniques with close attention paid to Nash equilibria, form and possibilities for the payoff functions, and the benefits of using a quantum strategy. In addition to comparing and contrasting these techniques, new applications and calculations are discussed. Finally, the techniques are expanded into 3 x 3 games which allows the study of non-transitive strategies in quantum games.

•Jan 1, 2002•0 citations

Quantum Multiplayer Colonel Blotto Game

Joydeep Naskar, A. C. Maioli

In this work we successfully present a quantum version of the multiplayer Colonel Blotto game. We find that players with access to the quantum strategies has a advantage over the classical ones. The payoff is invariant under the order of the strategies.

arXiv:2008.00762•Aug 3, 2020•1 citation

Quantum Game Theory approach for data network routing: a solution for the congestion problem

Agustin Silva, Omar Gustavo Zabaleta, Constancio Miguel Arizmendi

Abstract 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 this context, a novel framework is proposed for solving the congestion problem on communication networks using a quantum game theory model, where network packets compete selfishly for the shortest route. Simulations show that final network routing and traveling times achieved with the quantum game version outperform those obtained classically. 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, the game theoretic approach can be applied both in local networks and in more complex networks such as 5G or LTE-A.

Journal of Physics Conference Series•Mar 1, 2022•2 citations

Quantum game theory and the complexity of approximating quantum Nash equilibria

John Bostanci, John Watrous

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.

arXiv:2102.00512•Quantum•Dec 22, 2022•16 citations

Over recent years, quantum communication systems have demarcated themselves as promising candidates for deployment in next-generation communication networks (6G and beyond). Several recent experimental demonstrations of such complex systems have been highly successful and have been instrumental in transitioning this field from the theoretical to the practical domain. In this article, we investigate the application of quantum game theory for the modeling and analysis of jamming in the context of quantum networks. We begin with a general model of jamming based on the Colonel Blotto game and generalize it to the context of quantum networks. We provide an in-depth analysis of the two-person quantum Colonel Blotto game (QCBG) in relation to classical versus classical, classical versus quantum, and quantum versus quantum strategies. We also investigate the Nash equilibria for such games via a multiagent adversarial reinforcement learning-based system. Finally, we discuss further optimizations on this model and outline several open problems for further research along these lines.

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

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.

Non-cooperative quantum games have received much attention recently. This thesis defines and divides current works into two major categories of gaming techniques with close attention paid to Nash equilibria, form and possibilities for the payoff functions, and the benefits of using a quantum strategy. In addition to comparing and contrasting these techniques, new applications and calculations are discussed. Finally, the techniques are expanded into 3 x 3 games which allows the study of non-transitive strategies in quantum games.

Abstract 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 this context, a novel framework is proposed for solving the congestion problem on communication networks using a quantum game theory model, where network packets compete selfishly for the shortest route. Simulations show that final network routing and traveling times achieved with the quantum game version outperform those obtained classically. 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, the game theoretic approach can be applied both in local networks and in more complex networks such as 5G or LTE-A.

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.