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

Springer eBooks

Relation between Channel Capacity and Quantum Minimax Decision in Quantum Information Theory

Kentaro Kato, Masao Osaki, Tomohiro Suzuki, Masashi Ban, Osamu Hirota

Published Jan 1, 1997• 1 citation
Publisher
DOI
10.1007/978-1-4615-5923-8_7

Related papers

Information capacity of quantum channels

Christopher King

Contemporary mathematics - American Mathematical Society•Jan 1, 2003•0 citations

A class of minimax decision problems with nonclassical information

Tamer Başar

In this paper we study the solution a class of minimax decision problems with nonclassical information patterns, which arise in the context of of communication over vector channels in the presence of jamming. A general procedure for obtaining the saddle-point solution is outlined, and closed-form solutions for some related constrained optimization problems are obtained.

IEEE Conference on Decision and Control (CDC)•Dec 1, 1982•2 citations

A Quantum-Statistical Treatment of the Channel Capacity of Information Theory

Gordon J. Lasher

•Jan 1, 1961•0 citations

A Game Theoretic Approach to Quantum Information

Xianhua Dai, V. P. Belavkin

This work is an application of game theory to quantum information. In a state estimate, we are given observations distributed according to an unknown distribution $P_θ$ (associated with award $Q$), which Nature chooses at random from the set $\{P_θ: θ\in Θ\}$ according to a known prior distribution $μ$ on $Θ$, we produce an estimate $M$ for the unknown distribution $P_θ$, and in the end, we will suffer a relative entropy cost $\mathcal{R}(P;M)$, measuring the quality of this estimate, therefore the whole utility is taken as $P \cdot Q -\mathcal{R}(P; M)$. In an introduction to strategic game, a sufficient condition for minimax theorem is obtained; An estimate is explored in the frame of game theory, and in the view of convex conjugate, we reach one new approach to quantum relative entropy, correspondingly quantum mutual entropy, and quantum channel capacity, which are more general, in the sense, without Radon-Nikodym (RN) derivatives. Also the monotonicity of quantum relative entropy and the additivity of quantum channel capacity are investigated.

arXiv:0710.0556•Oct 2, 2007•0 citations

Capacities of Quantum Channels and Quantum Coherent Information

Michael D. Westmoreland, Benjamin W. Schumacher

Lecture notes in computer science•Jan 1, 1999•3 citations

Information Capacity of the Matched Gaussian Channel with Jamming. 2. Infinite-Dimensional Channels

C. Richard Baker, I.-F. Chao

The additive infinite-dimensional Gaussian channel subject to jamming is modeled as a two-person zero-sum game with mutual information as the payoff function. The jammer's noise is added to the ambient Gaussian noise. The coder's signal energy is subject to a constraint given in terms of the RKHS of the covariance of the ambient noise; such a constraint is necessary in order that the capacity without feedback be finite. It is shown that use of this same RKHS constraint on the jammer's process is too strong; the jammer would then not be able to reduce capacity, regardless of the amount of jamming energy available. The constraint on the jammer is thus on the total jamming energy, without regard to its distribution relative to that of the ambient noise energy. The existence of a saddle value for the problem does not follow from the von Neuman minimax theorem in the original problem formulation. However, a solution is shown to exist. A saddle point, saddle value, and the jammer's minimax strategy are determined. The solution is a function of the problem

STIN•Oct 1, 1990•0 citations
This work is an application of game theory to quantum information. In a state estimate, we are given observations distributed according to an unknown distribution PθP_θPθ​ (associated with award QQQ), which Nature chooses at random from the set {Pθ:θ∈Θ}\{P_θ: θ\in Θ\}{Pθ​:θ∈Θ} according to a known prior distribution μμμ on ΘΘΘ, we produce an estimate MMM for the unknown distribution PθP_θPθ​, and in the end, we will suffer a relative entropy cost R(P;M)\mathcal{R}(P;M)R(P;M), measuring the quality of this estimate, therefore the whole utility is taken as P⋅Q−R(P;M)P \cdot Q -\mathcal{R}(P; M)P⋅Q−R(P;M). In an introduction to strategic game, a sufficient condition for minimax theorem is obtained; An estimate is explored in the frame of game theory, and in the view of convex conjugate, we reach one new approach to quantum relative entropy, correspondingly quantum mutual entropy, and quantum channel capacity, which are more general, in the sense, without Radon-Nikodym (RN) derivatives. Also the monotonicity of quantum relative entropy and the additivity of quantum channel capacity are investigated.
The additive infinite-dimensional Gaussian channel subject to jamming is modeled as a two-person zero-sum game with mutual information as the payoff function. The jammer's noise is added to the ambient Gaussian noise. The coder's signal energy is subject to a constraint given in terms of the RKHS of the covariance of the ambient noise; such a constraint is necessary in order that the capacity without feedback be finite. It is shown that use of this same RKHS constraint on the jammer's process is too strong; the jammer would then not be able to reduce capacity, regardless of the amount of jamming energy available. The constraint on the jammer is thus on the total jamming energy, without regard to its distribution relative to that of the ambient noise energy. The existence of a saddle value for the problem does not follow from the von Neuman minimax theorem in the original problem formulation. However, a solution is shown to exist. A saddle point, saddle value, and the jammer's minimax strategy are determined. The solution is a function of the problem