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

Cambridge University Press eBooks

Classical and quantum entropy

Benjamin W. Schumacher, Michael D. Westmoreland

Published Mar 25, 2010• 0 citations
Publisher
DOI
10.1017/cbo9780511814006.020

Related papers

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

Properties of quantum entropy

Dėnes Petz

Lecture notes in mathematics•Jan 1, 1985•13 citations

ON QUANTUM MUTUAL TYPE MEASURES AND CAPACITY

Noboru Watanabe

The study of classical mutual entropy has been extensively done by several researchers like Kolmogorov and Gelfand. In quantum system, there are several definitions of the mutual entropy from classical inputs to quantum outputs, which are called semi-classical mutual entropy. In 1983, Ohya introduced a fully quantum mutual entropy by means of the relative entropy of Umegaki, and he extended it to general quantum systems by using the relative entropy of Araki and Uhlmann. It is showed that the Ohya mutual entropy contains the definitions of the semi-classical mutual entropy including the classical mutual entropy. Recently, Bennet, Nielsen, Shor et al. took the coherent information and so-called Lindblad - Nielsen's entropy for discuss a sort of coding theorem for communication processes. One can be concluded that Ohya mutual entropy is a most suitable one for studying the information transmission in quantum communication systems.

•Mar 1, 2006•0 citations

Quantum Entropy

François Chapeau‐Blondeau

Springer eBooks•Jan 1, 2026•0 citations

A Note on Quantum Entropy

Frank Hansen

arXiv:1511.09189•Mathematical Physics Analysis and Geometry•May 12, 2016•2 citations

A Brief Review of Classical and Quantum Relationships Between Entropy and Information

Donovan X Chapman

In this review paper, different definitions of classical entropies and a quantum version of entropy, the von Neumann Entropy, are introduced. Correlations between these classical and quantum models of entropy and the relevance of each in information theory are shown. Computing and quantum teleportation are discussed with the goal of providing a pedagogical introduction to some of the applications of information theory.

•Nov 10, 2026•0 citations
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 study of classical mutual entropy has been extensively done by several researchers like Kolmogorov and Gelfand. In quantum system, there are several definitions of the mutual entropy from classical inputs to quantum outputs, which are called semi-classical mutual entropy. In 1983, Ohya introduced a fully quantum mutual entropy by means of the relative entropy of Umegaki, and he extended it to general quantum systems by using the relative entropy of Araki and Uhlmann. It is showed that the Ohya mutual entropy contains the definitions of the semi-classical mutual entropy including the classical mutual entropy. Recently, Bennet, Nielsen, Shor et al. took the coherent information and so-called Lindblad - Nielsen's entropy for discuss a sort of coding theorem for communication processes. One can be concluded that Ohya mutual entropy is a most suitable one for studying the information transmission in quantum communication systems.