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

Multiplayer Quantum Games and its Application as Access Controller in Architecture of Quantum Computers

Paulo Benicio, Melo de Sousa, Rubens Viana Ramos

Published Feb 25, 2008• 0 citations
arXivHTMLPDF

Abstract

One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If there is not enough resource in order to attend the demand, some kind of control access has to be employed. In this work, recognizing the resource sharing problem as a competition, we employ a simplified multiplayer quantum game as an access controller. The proposed quantum game can be employed in the architecture of quantum computers.

DOI
10.48550/arxiv.0802.3684

Related papers

Multiplayer quantum games and its application as access controller in architecture of quantum computers

Paulo Benicio Melo de Sousa, Rubens Viana Ramos

Quantum Information Processing•Jun 1, 2008•12 citations

Multiplayer quantum games

Simon C. Benjamin, Patrick M. Hayden

Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess an alternative form of equilibrium strategy, one which has no analog either in traditional games or even in two-player quantum games. In these ``coherent'' equilibria, entanglement shared among multiple players enables different kinds of cooperative behavior: indeed it can act as a contract, in the sense that it prevents players from successfully betraying one another.

arXiv:quant-ph/0007038•Physical Review A•Aug 13, 2001•307 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

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

Quantum Multiplexing for Quantum Computer Networks

Juan Carlos García-Escartín, Pedro Chamorro‐Posada

In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is possible to share a new kind of resource. All of the system channels can be accommodated into a single channel in a larger Hilbert space. In the scheme, a single line combines the information of all the users, and, at the receiver, the original quantum channels are recovered. The given multiplexer/demultiplexer circuit can perform this n qubits to qudit transformation. Connections with superdense coding and classical multiple access schemes are discussed.

arXiv:quant-ph/0701145•Jan 22, 2007•4 citations

Quantum Game Techniques Applied to Wireless Networks Communications

Omar Gustavo Zabaleta, Constancio Miguel Arizmendi

In order to analyze the power control problem, the wireless quantum network nodes are modeled as players at a quantum game. The power control problem is one of the most significant wireless communications challenges which characteristics make it proper to be modeled by means of game theory techniques. The problem results in non-cooperative game by nature, but, under quantum rules, a larger strategy space leads the players to choose a coalition strategy as the best option. Thus, the use of quantum game strategies makes possible the emergence of new equilibrium, which guarantees the best possible performance to the whole network. We show also that the whole network power consumption decreases when the intrinsic parallel behavior of quantum computation is capitalized. Moreover, the design of efficient medium access control algorithms is possible.

Journal of Advances in Applied & Computational Mathematics•Oct 10, 2014•4 citations
One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If there is not enough resource in order to attend the demand, some kind of control access has to be employed. In this work, recognizing the resource sharing problem as a competition, we employ a simplified multiplayer quantum game as an access controller. The proposed quantum game can be employed in the architecture of quantum computers.
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess an alternative form of equilibrium strategy, one which has no analog either in traditional games or even in two-player quantum games. In these ``coherent'' equilibria, entanglement shared among multiple players enables different kinds of cooperative behavior: indeed it can act as a contract, in the sense that it prevents players from successfully betraying one another.
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.
In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is possible to share a new kind of resource. All of the system channels can be accommodated into a single channel in a larger Hilbert space. In the scheme, a single line combines the information of all the users, and, at the receiver, the original quantum channels are recovered. The given multiplexer/demultiplexer circuit can perform this n qubits to qudit transformation. Connections with superdense coding and classical multiple access schemes are discussed.
In order to analyze the power control problem, the wireless quantum network nodes are modeled as players at a quantum game. The power control problem is one of the most significant wireless communications challenges which characteristics make it proper to be modeled by means of game theory techniques. The problem results in non-cooperative game by nature, but, under quantum rules, a larger strategy space leads the players to choose a coalition strategy as the best option. Thus, the use of quantum game strategies makes possible the emergence of new equilibrium, which guarantees the best possible performance to the whole network. We show also that the whole network power consumption decreases when the intrinsic parallel behavior of quantum computation is capitalized. Moreover, the design of efficient medium access control algorithms is possible.