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

Quantum communication using quantum game theory

Muhammad Asif Ramzan, Majid Khan

Published Oct 23, 2009• 0 citations
arXivHTMLPDF

Abstract

This paper has been withdrawn by the author(s), due to some technical problem.
DOI
10.48550/arxiv.0910.4603

Related papers

Withdrawn: Quantum Communication Under Memory and Entanglement Constraints

Michael Aaron Cody

This preprint has been withdrawn at the request of the author due to fundamental structural problems that cannot be resolved by updating the manuscript.

•Oct 23, 2025•0 citations

Withdrawn: Quantum Communication Under Memory and Entanglement Constraints

Michael Aaron Cody

This preprint has been withdrawn at the request of the author due to fundamental structural problems that cannot be resolved by updating the manuscript.

•Oct 14, 2025•0 citations

Creation of perfect long-distance quantum communication channel

Bing He, Yuhang Ren, János A. Bergou

This paper has been withdrawn by the authors, due a oversimplified decoherence model. It will be substituted by a new work.

arXiv:0807.0878•Jul 5, 2008•0 citations

Designing Quantum Game Strategies from Quantum Communication Protocols

一雄 岩間, 治道 西村, ルディ レイモンド

IEICE Technical Report; IEICE Tech. Rep.•May 19, 2009•0 citations

Communication and Computation by Quantum Games

Takeshi Kawakami

Lecture notes in computer science•Jan 1, 2002•1 citation

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•24 citations
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.