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 proceedings in mathematics & statistics

Note on Complexity of Communication Processes

Noboru Watanabe

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-06170-7_5

Related papers

Composition Theorems in Communication Complexity

Troy Lee, Shengyu Zhang

arXiv:1003.1443•Lecture notes in computer science•Jan 1, 2010•34 citations

A Note on Improved Treatment of Gaussian Communication Process

Taihei Takahash, Noboru Watanabe

In order to discuss the efficiency of information transmission of the Gaussian communication processes consistently, we introduced an entropy type functional and a mutual entropy type functional in reference [16]. In that study, we used the set of Gaussian input measures with covariance operators of trace one. In this paper, we refine the formulation and modify the entropy type complexity and the mutual entropy type complexity to be able to study the efficiency of information transmission for more general input Gaussian measures and Gaussian channels.

Open Systems & Information Dynamics•Sep 1, 2021•0 citations

NOTE ON COMPLEXITIES FOR GAUSSIAN COMMUNICATION PROCESSES

Noboru Watanabe

In order to study several complex systems synthetically, Prof. Ohya introduced a new concept so-called Information Dynamics synthesizing the dynamics of state change and complexity of state. In Information Dynamics, two kind of complexities, that is, a complexity of state of system itself and a transmitted complexity between two systems, are used. In Shannon’s information theory, the effciency of the information communication processes is studied by using Shannon’s entropy and the mutual entropy (information) based on the classical probability theory. These entropies correspond to two complexities in Information Dynamics, respectively. In quantum information theory, one can discuss the effciency of the quantum communication processes using by von Neumann entropy (or S-mixing entropy 8 ) and Ohya mutual entropy. Those entropies are also examples of two complexities of Information Dynamics. An important axiom of complexities in Information Dynamics is given by inequalities of two complexities as follows: “Transmitted complexity with respect to an input state and a communication channel is less than a complexity of the input state.” In Shannon’s information theory, it is called a Shannon’s type inequalities, which shows that the mutual entropy represents the quantity of information exactly sending from the input system to the output system through the communication channel. By the way, for a simple model, the Shannon’s type inequalities do not satisfied in Gaussian communication processes. In Ref. 12, we introduced two complexities under three assumptions to solve this difficulty. In this paper, we propose two complexities under two assumptions by using a equivalent class in order to treat the Gaussian communication processes according to the concept of Information Dynamics.

QP-PQ, quantum probability and white noise analysis•Jan 1, 2013•0 citations

Dimension-free bounds and structural results in communication complexity

Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami

Israel Journal of Mathematics•Oct 20, 2022•22 citations

Note on complexity of quantum transmission processes

Нобoрy Ватанабе, Noboru Watanabe

In 1989, Ohya propose a new concept, so-called Information Dynamics (ID), to investigate complex systems according to two kinds of view points.One is the dynamics of state change and another is measure of complexity.In ID, two complexities C S and T S are introduced.C S is a measure for complexity of system itself, and T S is a measure for dynamical change of states, which is called a transmitted complexity.An example of these complexities of ID is entropy for information transmission processes.The study of complexity is strongly related to the study of entropy theory for classical and quantum systems.The quantum entropy was introduced by von Neumann around 1932, which describes the amount of information of the quantum state itself.It was extended by Ohya for C*-systems before CNT entropy.The quantum relative entropy was first defined by Umegaki for σ-finite von Neumann algebras, which was extended by Araki and Uhlmann for general von Neumann algebras and *-algebras, respectively.By introducing a new notion, the so-called compound state, in 1983 Ohya succeeded to formulate the mutual entropy in a complete quantum mechanical system (i.e., input state, output state and channel are all quantum mechanical) describing the amount of information correctly transmitted through the quantum channel.In this paper, we briefly review the entropic complexities for classical and quantum systems.We introduce some complexities by means of entropy functionals in order to treat the transmission processes consistently.We apply the general frames of quantum communication to the Gaussian communication processes.Finally, we discuss about a construction of compound states including quantum correlations.

Вестник Самарского государственного технического университета Серия Физико-математические науки•Jan 1, 2013•0 citations

On the Communication Complexity of Co-linearity Problems

Andrew Chi-Chih Yao

Lecture notes in computer science•Jan 1, 2005•0 citations
In order to discuss the efficiency of information transmission of the Gaussian communication processes consistently, we introduced an entropy type functional and a mutual entropy type functional in reference [16]. In that study, we used the set of Gaussian input measures with covariance operators of trace one. In this paper, we refine the formulation and modify the entropy type complexity and the mutual entropy type complexity to be able to study the efficiency of information transmission for more general input Gaussian measures and Gaussian channels.
In order to study several complex systems synthetically, Prof. Ohya introduced a new concept so-called Information Dynamics synthesizing the dynamics of state change and complexity of state. In Information Dynamics, two kind of complexities, that is, a complexity of state of system itself and a transmitted complexity between two systems, are used. In Shannon’s information theory, the effciency of the information communication processes is studied by using Shannon’s entropy and the mutual entropy (information) based on the classical probability theory. These entropies correspond to two complexities in Information Dynamics, respectively. In quantum information theory, one can discuss the effciency of the quantum communication processes using by von Neumann entropy (or S-mixing entropy 8 ) and Ohya mutual entropy. Those entropies are also examples of two complexities of Information Dynamics. An important axiom of complexities in Information Dynamics is given by inequalities of two complexities as follows: “Transmitted complexity with respect to an input state and a communication channel is less than a complexity of the input state.” In Shannon’s information theory, it is called a Shannon’s type inequalities, which shows that the mutual entropy represents the quantity of information exactly sending from the input system to the output system through the communication channel. By the way, for a simple model, the Shannon’s type inequalities do not satisfied in Gaussian communication processes. In Ref. 12, we introduced two complexities under three assumptions to solve this difficulty. In this paper, we propose two complexities under two assumptions by using a equivalent class in order to treat the Gaussian communication processes according to the concept of Information Dynamics.
In 1989, Ohya propose a new concept, so-called Information Dynamics (ID), to investigate complex systems according to two kinds of view points.One is the dynamics of state change and another is measure of complexity.In ID, two complexities C S and T S are introduced.C S is a measure for complexity of system itself, and T S is a measure for dynamical change of states, which is called a transmitted complexity.An example of these complexities of ID is entropy for information transmission processes.The study of complexity is strongly related to the study of entropy theory for classical and quantum systems.The quantum entropy was introduced by von Neumann around 1932, which describes the amount of information of the quantum state itself.It was extended by Ohya for C*-systems before CNT entropy.The quantum relative entropy was first defined by Umegaki for σ-finite von Neumann algebras, which was extended by Araki and Uhlmann for general von Neumann algebras and *-algebras, respectively.By introducing a new notion, the so-called compound state, in 1983 Ohya succeeded to formulate the mutual entropy in a complete quantum mechanical system (i.e., input state, output state and channel are all quantum mechanical) describing the amount of information correctly transmitted through the quantum channel.In this paper, we briefly review the entropic complexities for classical and quantum systems.We introduce some complexities by means of entropy functionals in order to treat the transmission processes consistently.We apply the general frames of quantum communication to the Gaussian communication processes.Finally, we discuss about a construction of compound states including quantum correlations.