QP-PQ, quantum probability and white noise analysis
NOTE ON COMPLEXITIES FOR GAUSSIAN COMMUNICATION PROCESSES
Noboru Watanabe
Abstract
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.