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

Quantum Dynamical Mutual Entropy Based on AOW Entropy

Kyouhei Ohmura, Noboru Watanabe

Published Jun 1, 2019• 9 citations
Publisher

Abstract

The classical dynamical mutual entropy measures the average of information content going through a channel. Classical Markovian sources are important in communication theory since they constitute reasonable models for languages. In this paper, we define the quantum dynamical mutual entropy through quantum Markov chains, and we calculate it for several simple models.

DOI
10.1142/s1230161219500094

Related papers

Mean mutual entropy in quantum Markov chains

Hiroki Suyari

Mutual entropy was introduced in classical communication theories to measure how much information can be transmitted from an input system to an output system. It has been expanded to quantum systems and applied to various physical models. By contrast, quantum Markov chains, introduced as an extension of classical Markov chains, have been used to explain the irreversibility of observed systems. In [1], a physical model used frequently in quantum optics was applied to a quantum Markov chain. The Stinespring-Kraus expression was derived to discuss mutual entropy on quantum Markov chains. Mutual entropy was then computed and irreversibility was examined using numerical experiments. To further the ongoing research, mean mutual entropy is applied here to the same quantum Markov chain as the previous one; necessary discussion is included. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(1): 104–112, 1997

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Jan 1, 1997•1 citation

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

ON QUANTUM MUTUAL TYPE ENTROPIES AND QUANTUM CAPACITY

Noboru Watanabe

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.

Stochastic Analysis: Classical and Quantum•Oct 1, 2005•0 citations

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

On Quantum Entropies for the Compound Quantum Channel

Noboru Watanabe

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.

Open Systems & Information Dynamics•Mar 1, 2026•0 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
The classical dynamical mutual entropy measures the average of information content going through a channel. Classical Markovian sources are important in communication theory since they constitute reasonable models for languages. In this paper, we define the quantum dynamical mutual entropy through quantum Markov chains, and we calculate it for several simple models.
Mutual entropy was introduced in classical communication theories to measure how much information can be transmitted from an input system to an output system. It has been expanded to quantum systems and applied to various physical models. By contrast, quantum Markov chains, introduced as an extension of classical Markov chains, have been used to explain the irreversibility of observed systems. In [1], a physical model used frequently in quantum optics was applied to a quantum Markov chain. The Stinespring-Kraus expression was derived to discuss mutual entropy on quantum Markov chains. Mutual entropy was then computed and irreversibility was examined using numerical experiments. To further the ongoing research, mean mutual entropy is applied here to the same quantum Markov chain as the previous one; necessary discussion is included. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(1): 104–112, 1997
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 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.
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 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 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.