A lifting is a continuous map from a system to a compound system, and it is useful to describe several physical processes. Ohya and Accardi introduced the notion of it and characterized liftings 1 . In this paper, we define a generalized quantum mutual entropy through liftings satisfying some conditions. In some cases, it satisfies the Shannon inequality and some cases not.
A lifting is a continuous map from a system to a compound system, and it is useful to describe several physical processes. Ohya and Accardi introduced the notion of it and characterized liftings 1 . In this paper, we define a generalized quantum mutual entropy through liftings satisfying some conditions. In some cases, it satisfies the Shannon inequality and some cases not.
A lifting is a continious map from a system to a compound system introduced by Ohya and Accardi [1], and we can represent several dynam- ical processes by using it.Liftings show the relation between two systems in the compound system clearly, and it is useful to discuss not only the communication process, but also an entanglement of it.In this study we define a quantum mutual entropy using liftings and investigate the property.We show that there exist some cases where the quantum mutual entropy violates the Shannon inequality.
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.
The quantum entropy introduced by von Neumann around 1932 describes the amount of information of the quantum state itself. It was extended by Ohya for C*-systems before Conne-Narnhoffer-Thirring (CNT) entropy. The quantum relative entropy was first defined by Umegaki for σ-finite von Neumann algebras and it was subsequently 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 construct 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 Ohya's S-mixing entropy and the quantum mutual entropy for general quantum systems. Based on a concept of structure equivalent, we apply the general framework of quantum communication to the Gaussian communication processes.
In classical information theory, the most important theorems are the coding theorems, which were discussed by calculating the mean entropy and the mean mutual entropy defined by the classical dynamical entropy (Kolmogorov–Sinai). The quantum dynamical entropy was first studied by Emch [13] and Connes–Stormer [11]. After that, several approaches for introducing the quantum dynamical entropy were proposed [10,[Formula: see text]3,[Formula: see text]8,[Formula: see text]39,[Formula: see text]15,[Formula: see text]44,[Formula: see text]9,[Formula: see text]27,[Formula: see text]28,[Formula: see text]2,[Formula: see text]19,[Formula: see text]45]. The efficiency of information transmission for the quantum processes is investigated by using the von Neumann entropy [22] and the Ohya mutual entropy [24]. These entropies were extended to S-mixing entropy by Ohya [26,[Formula: see text]27] in general quantum systems. The mean entropy and the mean mutual entropy for the quantum dynamical systems were introduced based on the S-mixing entropy. In this paper, based on research into the dynamical entropy and mean mutual entropy of quantum systems, this study investigates the characteristics of quantum channels that exhibit entanglement, a property unique to quantum systems, and investigates the behaviour of quantum entropy for compound quantum channels by changing the perspective from information transmission between input and output to a new perspective of information transmission from the initial state to the final state.
The quantum entropy was introduced by von Neumann around 1932, which describes the amont of information of the quantum state itself. It was extended by Ohya for C*‐systems. The quantum relative entropy was first defined by Umegaki for σ ‐finite von Neumann algebras, which denotes a certain difference between two states. It was extended by Araki and Uhlmann for general von Neumann algebras and *‐algebras, respectively. The development of communication theory is closely connected with study of entropy theory. In order to discuss the commuinication processes, we need at least two systems, such as input and output systems. The signal of the input system is carried through a physical device, which is called a channel. The mathematical representation of the channel is a mapping from the input state space to the output state space. The mutual entropy (information) defined by using the relative entropy between the product state consist of the input state and the output state and the compound state given by the communication process, expresses the amount of information correctly transmitted through the channel from the input system to the output system. In classical communication theory, the mutual entropy was formulated by using the joint probability distribution between the input system and the output system. The (semi‐classical) mutual entropies for classical input and quantum output were defined by several researchers. In fully quantum system, there does not exist the joint probability distribution in general. Instead of the joint probability distribution, Ohya invented the quantum (Ohya) compound state, and he introduced the fully quantum mutual entropy (information), which is called Ohya mutual entropy, for quantum input and output systems, describes the amount of information correctly sent from the quantum input system to the quantum output system through the quantum channel. It was extended by Ohya for general quantum systems. Recently Shor and Bennet et al took the coherent entropy and defined the mutual type entropy to discuss a sort of coding theorem for communication processes.In this paper, we concretely calculate these mutual entropy‐type measures for the attenuation channel in order to assay these abilities.
von Neumann entropy represents the amount of information in the quantum state, and this was extended by Ohya for general quantum systems [10]. Umegaki first defined the quantum relative entropy for -finite von Neumann algebras, which was extended by Araki, and Uhlmann, for general von Neumann algebras and *-algebras, respectively. In 1983 Ohya introduced the quantum mutual entropy by using compound states; this describes the amount of information correctly transmitted through the quantum channel, which was also extended by Ohya for general quantum systems. In this paper, we briefly explain Ohya?s -mixing entropy and the quantum mutual entropy for general quantum systems. By using structure equivalent class, we will introduce entropy type functionals based on quantum information theory to improve treatment for the Gaussian communication process.