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 · Quantum Information Processing

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

Paulo Benicio Melo de Sousa, Rubens Viana Ramos

Published Jun 1, 2008• 13 citations
arXivHTMLPDF
DOI
10.1007/s11128-008-0078-5

Related papers

Multiplayer quantum games with continuous-variable strategies

Jie Zhou, Лей Ма, Yun Li

Physics Letters A•Mar 16, 2005•25 citations

Decoherence Effects on Multiplayer Cooperative Quantum Games

Salman, Хан, Ramzan +1 more

理论物理通讯:英文版•Jan 1, 2011•0 citations

Entanglement enhanced multiplayer quantum games

Jiangfeng Du, Hui Li, Xiaodong Xu +2 more

arXiv:quant-ph/0110122•Physics Letters A•Sep 1, 2002•97 citations

Quantum-over-Classical Advantage in Solving Multiplayer Games

Dmitry Kravchenko, Kamil Ravilevich Khadiev, Danil Serov +1 more

arXiv:2006.06965•Lecture notes in computer science•Jan 1, 2020•8 citations

Quantum Games and Quantum Computers

Vladimir G. Ivancevic, Tijana T. Ivancevic

WORLD SCIENTIFIC eBooks•Oct 1, 2008•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
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.