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

数理解析研究所講究録

Operator-valued divergence and entropy(Information and mathematics of non-additivity and non-extensivity : from the viewpoint of functional analysis)

淳一 藤井

Published Jun 1, 2007• 0 citations
OpenAlex

Abstract

)とすると $\sum\Lambda E_{n}=I$ と、 Jensen type inequality より、 $H_{E}(A; \Lambda)=\eta(\sum_{n}t_{n}\Lambda E_{n})-\sum_{n}t_{n}\eta(\Lambda E_{n})\geq 0$ という非負の量 $H_{E}(A, \Lambda)$ を Holevo 型の相互作用素エントロピーと見ることができる。こ のとき、 これらのトレースを取ると、 Ohya mutual entropy と一致するので、分解につい ての最大として対応する通信容量も一致することが分かる。実は、 このことは、本質的に[17] で示されているが、 ここで確認しておこう。 定理.密度行列 $A$ と、 その Shatten 分解 $E:A= \sum_{n}t_{n}E_{n}$ について、 Tr $H_{E}(A;\Lambda)=RM_{E}(A;\Lambda)$ , $\max_{E}RH_{E}(A;\Lambda)=I(A;\Lambda)$ .

Related papers

Generalizations of operator Shannon inequality based on Tsallis and Renyi relative entropies (Operator monotone functions and related topics)

Masatoshi Ito, Hiroshi Isa, Eizaburo Kamei +2 more

数理解析研究所講究録•May 1, 2014•0 citations

Note on Information Transmission in Quantum Systems(Information and mathematics of non-additivity and non-extensivity : from the viewpoint of functional analysis)

Noboru Watanabe

The mutual entroy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel.The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers.The funy quantum mutual entropy, which is called Ohya mutual entroy, for quantum input and output by using the relative entropy was defined by Ohya in 1983.In this paper, we $\infty mpue$ With mutual $entropy-WPe$ measures and show some resuls for quantum capacity.

•Jun 1, 2007•0 citations

Generalizations of operator Shannon inequality based on Tsallis and Renyi relative entropies (Operator monotone functions and related topics)

公智 伊藤, 浩史 伊佐, Eizaburo Kamei +2 more

数理解析研究所講究録•May 1, 2014•0 citations

Universal Bounds for the Holevo Quantity, Coherent Information, and the Jensen-Shannon Divergence

Wojciech Roga, M. Fannes, Karol Życzkowski

The mutual information between the sender of a classical message encoded in quantum carriers and a receiver is fundamentally limited by the Holevo quantity. Using strong subadditivity of entropy, we prove that the Holevo quantity is not larger than an exchange entropy. This implies an upper bound for coherent information. Moreover, restricting our attention to classical information, we bound the transmission distance between probability distributions by their entropic distance, which is a concave function of their Hellinger distance.

arXiv:1004.4782•Physical Review Letters•Jul 23, 2010•68 citations

Some Aspects of Quantum Mutual Type Entropies(Micro-Macro Duality in Quantum Analysis)

Noboru Watanabe

The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel.The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers.The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983.In this paper, we $\mathrm{c}o$ mpare with mutual $\mathrm{e}\mathrm{n}\mathrm{t}\mathrm{r}\mathrm{o}_{\Psi}$ -type measures and show some resuls for quantum capacity.

数理解析研究所講究録•Jul 1, 2006•0 citations

A formulation of Rényi entropy on $$C^*$$-algebras

Farrukh Maksutovich Mukhamedov, Kyouhei Ohmura, Noboru Watanabe

arXiv:1905.03498•Quantum Information Processing•Aug 26, 2019•3 citations
)とすると ∑ΛEn=I\sum\Lambda E_{n}=I∑ΛEn​=I と、 Jensen type inequality より、 HE(A;Λ)=η(∑ntnΛEn)−∑ntnη(ΛEn)≥0H_{E}(A; \Lambda)=\eta(\sum_{n}t_{n}\Lambda E_{n})-\sum_{n}t_{n}\eta(\Lambda E_{n})\geq 0HE​(A;Λ)=η(∑n​tn​ΛEn​)−∑n​tn​η(ΛEn​)≥0 という非負の量 HE(A,Λ)H_{E}(A, \Lambda)HE​(A,Λ) を Holevo 型の相互作用素エントロピーと見ることができる。こ のとき、 これらのトレースを取ると、 Ohya mutual entropy と一致するので、分解につい ての最大として対応する通信容量も一致することが分かる。実は、 このことは、本質的に[17] で示されているが、 ここで確認しておこう。 定理.密度行列 AAA と、 その Shatten 分解 E:A=∑ntnEnE:A= \sum_{n}t_{n}E_{n}E:A=∑n​tn​En​ について、 Tr HE(A;Λ)=RME(A;Λ)H_{E}(A;\Lambda)=RM_{E}(A;\Lambda)HE​(A;Λ)=RME​(A;Λ) , max⁡ERHE(A;Λ)=I(A;Λ)\max_{E}RH_{E}(A;\Lambda)=I(A;\Lambda)maxE​RHE​(A;Λ)=I(A;Λ) .
The mutual entroy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel.The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers.The funy quantum mutual entropy, which is called Ohya mutual entroy, for quantum input and output by using the relative entropy was defined by Ohya in 1983.In this paper, we ∞mpue\infty mpue∞mpue With mutual entropy−WPeentropy-WPeentropy−WPe measures and show some resuls for quantum capacity.
The mutual information between the sender of a classical message encoded in quantum carriers and a receiver is fundamentally limited by the Holevo quantity. Using strong subadditivity of entropy, we prove that the Holevo quantity is not larger than an exchange entropy. This implies an upper bound for coherent information. Moreover, restricting our attention to classical information, we bound the transmission distance between probability distributions by their entropic distance, which is a concave function of their Hellinger distance.
The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel.The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers.The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983.In this paper, we co\mathrm{c}oco mpare with mutual entroΨ\mathrm{e}\mathrm{n}\mathrm{t}\mathrm{r}\mathrm{o}_{\Psi}entroΨ​ -type measures and show some resuls for quantum capacity.
A formulation of Rényi entropy on C∗C^*C∗-algebras