We are interested to study the dynamics of state change or the complexity of state for several systems. Information dynamics (ID) is a new concept introduced by Ohya to construct a theory under the ID's framework by synthesizing these investigating schemes. In ID, a complexity of state describing system itself and a transmitted complexity between two systems are used. One of the example of these complexities are the Shannon's entropy and the mutual entropy (information) in classical entropy theory. In quantum entropy theory, it was known that the von Neumann entropy and the Ohya mutual entropy relate to these complexities. Recently, several mutual entropy type measures (the Lindblad-Nielsen entropy and the Coherent entropy) were proposed by means of the entropy exchange for an input state and a channel. The quantum capacity is defined by taking the supremum for the Ohya mutual entropy. The main purpose of this paper is to compare with these mutual entropy type complexities in order to find most congruous one for studying the quantum communication process. In this paper, we calculate the quantum capacity for some simple models for discussing the information transmission for OOK and PSK modulations.
We are interested to study the dynamics of state change or the complexity of state for several systems. Information dynamics (ID) is a new concept introduced by Ohya to construct a theory under the ID's framework by synthesizing these investigating schemes. In ID, a complexity of state describing system itself and a transmitted complexity between two systems are used. One of the example of these complexities are the Shannon's entropy and the mutual entropy (information) in classical entropy theory. In quantum entropy theory, it was known that the von Neumann entropy and the Ohya mutual entropy relate to these complexities. Recently, several mutual entropy type measures (the Lindblad-Nielsen entropy and the Coherent entropy) were proposed by means of the entropy exchange for an input state and a channel. The quantum capacity is defined by taking the supremum for the Ohya mutual entropy. The main purpose of this paper is to compare with these mutual entropy type complexities in order to find most congruous one for studying the quantum communication process. In this paper, we calculate the quantum capacity for some simple models for discussing the information transmission for OOK and PSK modulations.
In a study of several systems, we are interested to examine (1) the dynamics of state change and (2) the complexity of states. Ohya introduced in 1991 (ref.[21]) a general idea so-called a Information Dynamics (ID), which constitutes a theory under a frame of the ID by synthesizing the formalities of the investigations of (1) and (2). There are two kind of complexities in ID. One is a complexity of state describing system itself and another is a transmitted complexity between two systems. Entropies of classical and quantum systems are the example of these complexities. In order to treat a flow of dynamics process, dynamical entropies were introduced in not only classical but also quantum systems. The main purpose of this paper is to compare with these mean entropies and the complexities in ID, we calculate these mean entropies for some simple models to discuss the complexity of information transmission for OOK and PSK modulations.
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.
In several complicated systems, it is important to study (1) the dynamics of state change and (2) the complexity of states of systems. Information Dynamics (ID) introduced by Ohya is a general idea constructing a theory by synthesizing the research schemes of (1) and (2) under a frame of the ID. In ID, there are two types of complexities, that is, (a) a complexity of state describing system itself and (b) a transmitted complexity between two systems. Entropies of classical and quantum information theory are the example of the complexities of (a) and (b). In quantum information theory, Ohya introduced a compound state and defined Ohya mutual entropy based on quantum relative entropy of Umegaki in 1983, he extended it to general quantum systems by using the relative entropy of Araki and Uhlmann. One can discuss the coding theorems by means of the mean entropy and the mean mutual entropy defined by the dynamical entropy. In this paper, we will discuss about complexity of quantum communication processes including quantum correlations.
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 quantum information theory, Emch, Conne, and Stormer were the first who studied the complexity of quantum dynamical processes. After that, Ohya introduced the [Formula: see text]-mixing entropy for general quantum systems and he defined the mean entropy and the mean mutual entropy for quantum dynamical systems based on the [Formula: see text]-mixing entropy. Conne, Narnhoffer and Thirring introduced the dynamical entropy (CNT entropy) and several researchers discussed this concept. Alicki and Fannes defined a different dynamical entropy — AF entropy. In 1995, Voiculescu proposed the dynamical approximation entropy. Accardi, Ohya and Watanabe defined yet another dynamical entropy (AOW entropy) through a quantum Markov process in 1997. In 1999, Kossakowski, Ohya and Watanabe introduced the dynamical entropy (KOW entropy) with respect to completely positive maps. In this paper, we discuss the complexity of quantum dynamical processes to calculate the dynamical entropy for noisy optical channels. In order to discuss the efficiency of information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Quantum entropies were formulated on the basis of the quantum probability theory. In quantum communication systems, von Neumann entropy and Ohya mutual entropy relate to these measures of complexities, respectively. Recently, several mutual entropy type measures (Lindblad-Nielsen entropy and coherent entropy) were defined making use of entropy exchange with respect to a channel and initial state. In this paper, we show which of the measures is the most suitable one for discussing the efficiency of information transmission for quantum processes.
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, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy - type measures introduced in the studies of quantum information. In this paper, we compare with these mutual entropy-type measures in order to obtain most suitable one for discussing the information transmission for quantum communication processes.