Transmitted complexity (mutual entropy) is one of the important measures for quantum information theory developed recently in several ways. We will review the fundamental concepts of the Kossakowski, Ohya and Watanabe entropy and define a transmitted complexity for quantum dynamical systems.This article is part of the themed issue 'Second quantum revolution: foundational questions'.
Transmitted complexity (mutual entropy) is one of the important measures for quantum information theory developed recently in several ways. We will review the fundamental concepts of the Kossakowski, Ohya and Watanabe entropy and define a transmitted complexity for quantum dynamical systems.This article is part of the themed issue 'Second quantum revolution: foundational questions'.
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.
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 Ref. 27, Ohya proposed the information dynamics synthesizing several ways of studying complex systems. In information dynamics, there are two types of complexities, one is a complexity of state representing system itself and another is a transmitted complexity between two systems. Entropies in classical and quantum systems are examples of these complexities of information dynamics. Transmitted complexity is an important tool to analyze the efficiency of information transmission in communication processes. In order to treat a flow of dynamical process, dynamical entropies were introduced in not only classical but also quantum systems. Based on the transition expectation introduced by Accardi to study quantum Markov process, the KOW entropy for completely positive (CP) maps was defined in Ref. 17. The generalized AOW and the AF entropies was constructed by the KOW entropy. The compound states are important tool to define the transmitted entropy 43,44. The transmitted complexity associated with the separable compound states is defined by using the generalized AOW entropy in Refs. 36 and 45. In this paper, we define a transmitted complexity (quantum dynamical mutual entropy) by means of the modified compound states and we prove the fundamental inequalities of the transmitted complexity for the independent quantum dynamical systems.
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.
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.
Based on the classical dynamical entropy, the channel coding theorem is investigated. Attempts to extend the dynamical entropy to quantum systems have been made by several researchers In 1999, Kossakowski, Ohya and I introduced the quantum dynamical entropy (KOW entropy) for completely positive maps containing an automorphism describing the time evolution. Its formulation used transition expectations and lifting in the sense of Accardi and Ohya and was studied as a measure of the complexity of quantum mechanical systems. This KOW entropy allowed the extension of generalized AF (Alicki and Fannes) entropy and generalized AOW (Accardi, Ohya and Watanabe) entropy. In addition, the S-Mixing entropy and S-mixing mutual-entropy were formulated by Ohya in 1985. Compound states are an important tool for formulating mutual entropy, and the complexity was constructed by the generalized AOW entropy. In this paper, the complexity associated with the entangled compound states in the C* dynamical system based on the generalized AOW entropy based on the KOW entropy is investigated to lay the foundation for the proof of the theorem of channel coding for quantum systems. We show that the fundamental inequalities of the mutual entropy are satisfied when the initial state is transmitted over the channel changes with time.