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

Open Systems & Information Dynamics

On Quantum Entropies for the Compound Quantum Channel

Noboru Watanabe

Published Mar 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1142/s1230161226500034

Related papers

Quantum transmission processes and their entropies

Noboru Watanabe

In classical information theory, one of 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 are done [10, 3, 8, 39, 15, 44, 9, 27, 28, 2, 19, 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, 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, we discuss the efficiency of information transmission to calculate the mean mutual entropy with respect to the modulated initial states and the connected channel for the quantum dynamical systems.

Russian Journal of Mathematical Physics•Jul 1, 2014•2 citations

Some Aspects of Entropies for Quantum Processes

Noboru Watanabe, Luigi Accardi, Guillaume Adenier +5 more

The classical entropies were formulated by means of the classical probability theory. The essence of the classical probability theory corresponds to the use of c‐number with commutative property. On the base of the classical probability theory, the classical information theory can be discussed by using the classical entropies. On the other hand, the principle of the quantum phenomenon seems to be having non‐commutative behavior. It leads to the use of the q‐operator with non‐commutative property to introduce the quantum entropies based on the quantum probability theory. In order to discuss the efficiency of the information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Shannon’s entropy and the mutual entropy represent these measures of complexities in classical communication system, respectively. Von Neumann entropy and Ohya mutual entropy relate to these measures of complexities in quantum communication system, respectively. Recently, several mutual entropy type measures (Lindblad—Nielsen entropy and Coherent entropy) were proposed by using an entropy exchange with respect to a channel and an initial state. In this paper, we will show the most suitable one for discuss the efficiency of information transmission for quantum processes. In classical information theory, one of the most important tools to analyze communication processes are the classical coding theorems, which was investigated through the classical dynamical entropy. The classical dynamical entropy was discussed in [1] with respect to a measure preserving transformation defined on a message space for finite partitions of the measure space. In quantum information theory, Emch [2] and Conne, Stormer [3] first studied a complexity of quantum dynamical processes. After that, Ohya introduced a S‐ mixing entropy in general quantum systems, which was natural extension of the von Neumann entropy. Using the S—mixing entropy, Ohya defined a mean entropy and a mean mutual entropy for the quantum dynamical systems. Conne, Narnhoffer and Thirring introduced a dynamical entropy (CNT entropy) [4] and several researchers discussed the CNT entropy [5,6,7,8]. Alicki and Fannes defined a dynamical entropy (AF entropy) [9] using a finite operational partitions of unity. In 1995, Voiculescu proposed a dynamical entropy (dynamical approximation entropy) [10] in C* and W* algebras. Through the quantum Markov process, Accardi, Ohya and Watanabe defined a dynamical entropy (AOW entropy) [11,12] in 1997. Base on transition expectations and liftings in the sense of Accardi and Ohya [13], Kossakowski, Ohya and Watanabe introduced a dynamical entropy (KOW entropy) [14] with respect to completely positive maps in 1999. In this paper, we will discuss the complexity of the quantum dynamical process to calculate the generalized AOW entropy given by KOW entropy.

AIP conference proceedings•Jan 1, 2009•0 citations

Numerical Calculation of Quantum Mutual Type Entropies

Noboru Watanabe

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.

AIP conference proceedings•Jan 1, 2006•0 citations

An Entropy Based Treatment of Gaussian Communication Process for General Quantum Systems

Noboru Watanabe

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.

Open Systems & Information Dynamics•Sep 1, 2013•1 citation

On General Quantum Mutual Entropy and Capacity

Noborn Watanabe

In communication processes, a channel has an activity to communicate information of input system to output system. 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 quantum coding theorem. We concretely calculate the quantum capacity for quantum channels.

AIP conference proceedings•Jan 1, 2005•0 citations

A Note on Entropies for Compound Systems

Noboru Watanabe

In quantum compound systems, joint (or compound) states usually do not exist [26]. The so-called Ohya compound state was defined by using the von Neumann–Schatten decomposition [23] of an input state and a quantum communication channel. Quantum mutual entropy [10] was introduced by using quantum relative entropy [24] between the Ohya compound state and the trivial (product) compound state on the compound (input and output) system. One of the remarkable results related to state entanglement is the Jamiolkowski isomorphism [5]. In this paper, we use the Jamiolkowski isomorphism for the construction of Ohya compound state and we discuss the existence of a completely positive map between compound entangled states and the Ohya compound states. The efficiency of information transmission is investigated by using the mean entropy and the mean mutual entropy [12, 6] of a connected channel.

Open Systems & Information Dynamics•Jun 1, 2015•8 citations
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.
In classical information theory, one of 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 are done [10, 3, 8, 39, 15, 44, 9, 27, 28, 2, 19, 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, 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, we discuss the efficiency of information transmission to calculate the mean mutual entropy with respect to the modulated initial states and the connected channel for the quantum dynamical systems.
The classical entropies were formulated by means of the classical probability theory. The essence of the classical probability theory corresponds to the use of c‐number with commutative property. On the base of the classical probability theory, the classical information theory can be discussed by using the classical entropies. On the other hand, the principle of the quantum phenomenon seems to be having non‐commutative behavior. It leads to the use of the q‐operator with non‐commutative property to introduce the quantum entropies based on the quantum probability theory. In order to discuss the efficiency of the information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Shannon’s entropy and the mutual entropy represent these measures of complexities in classical communication system, respectively. Von Neumann entropy and Ohya mutual entropy relate to these measures of complexities in quantum communication system, respectively. Recently, several mutual entropy type measures (Lindblad—Nielsen entropy and Coherent entropy) were proposed by using an entropy exchange with respect to a channel and an initial state. In this paper, we will show the most suitable one for discuss the efficiency of information transmission for quantum processes. In classical information theory, one of the most important tools to analyze communication processes are the classical coding theorems, which was investigated through the classical dynamical entropy. The classical dynamical entropy was discussed in [1] with respect to a measure preserving transformation defined on a message space for finite partitions of the measure space. In quantum information theory, Emch [2] and Conne, Stormer [3] first studied a complexity of quantum dynamical processes. After that, Ohya introduced a S‐ mixing entropy in general quantum systems, which was natural extension of the von Neumann entropy. Using the S—mixing entropy, Ohya defined a mean entropy and a mean mutual entropy for the quantum dynamical systems. Conne, Narnhoffer and Thirring introduced a dynamical entropy (CNT entropy) [4] and several researchers discussed the CNT entropy [5,6,7,8]. Alicki and Fannes defined a dynamical entropy (AF entropy) [9] using a finite operational partitions of unity. In 1995, Voiculescu proposed a dynamical entropy (dynamical approximation entropy) [10] in C* and W* algebras. Through the quantum Markov process, Accardi, Ohya and Watanabe defined a dynamical entropy (AOW entropy) [11,12] in 1997. Base on transition expectations and liftings in the sense of Accardi and Ohya [13], Kossakowski, Ohya and Watanabe introduced a dynamical entropy (KOW entropy) [14] with respect to completely positive maps in 1999. In this paper, we will discuss the complexity of the quantum dynamical process to calculate the generalized AOW entropy given by KOW entropy.
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.
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 communication processes, a channel has an activity to communicate information of input system to output system. 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 quantum coding theorem. We concretely calculate the quantum capacity for quantum channels.
In quantum compound systems, joint (or compound) states usually do not exist [26]. The so-called Ohya compound state was defined by using the von Neumann–Schatten decomposition [23] of an input state and a quantum communication channel. Quantum mutual entropy [10] was introduced by using quantum relative entropy [24] between the Ohya compound state and the trivial (product) compound state on the compound (input and output) system. One of the remarkable results related to state entanglement is the Jamiolkowski isomorphism [5]. In this paper, we use the Jamiolkowski isomorphism for the construction of Ohya compound state and we discuss the existence of a completely positive map between compound entangled states and the Ohya compound states. The efficiency of information transmission is investigated by using the mean entropy and the mean mutual entropy [12, 6] of a connected channel.