The theories of noncommutative dynamical entropy and quantum symbolic dynamics for quantum-dynamical systems are analyzed from the point of view of quantum information theory. Using a general quantum-dynamical system as a communication channel, one can define different classical capacities depending on the character of resources applied for encoding and decoding procedures and on the type of information sources. It is shown that for Bernoulli sources, the entanglement-assisted classical capacity, which is the largest one, is bounded from above by the quantum-dynamical entropy defined in terms of operational partitions of unity. Stronger results are proved for the particular class of quantum-dynamical systems---quantum Bernoulli shifts. Different classical capacities are exactly computed and the entanglement-assisted one is equal to the dynamical entropy in this case.
The theories of noncommutative dynamical entropy and quantum symbolic dynamics for quantum-dynamical systems are analyzed from the point of view of quantum information theory. Using a general quantum-dynamical system as a communication channel, one can define different classical capacities depending on the character of resources applied for encoding and decoding procedures and on the type of information sources. It is shown that for Bernoulli sources, the entanglement-assisted classical capacity, which is the largest one, is bounded from above by the quantum-dynamical entropy defined in terms of operational partitions of unity. Stronger results are proved for the particular class of quantum-dynamical systems---quantum Bernoulli shifts. Different classical capacities are exactly computed and the entanglement-assisted one is equal to the dynamical entropy in this case.
An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.
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.
Abstract A brief general review is presented of the theory of information transmission capacities of quantum communication channels, which is a development of the classical Shannon theory. Unlike a classical communication channel, a quantum channel is characterised by a whole set of different capacities, which depend on the type of transmitted information (classical or quantum) and on additional resources used during transmission. The main characteristics of a quantum channel are considered: classical capacity, capacity assisted by entanglement between the channel input and output, quantum capacity and secret classical capacity. The unique role of the quantum entanglement property, which manifests itself, in particular, in a nonclassical phenomenon of capacity superadditivity, is emphasised.
The operational structure of quantum couplings and entanglements is studied and classified for semi–finite von Neumann algebras. We show that the classical–quantum correspondences, such as quantum encodings, can be treated as diagonal semi–classical (d–) couplings, and the entanglements, characterized by truly quantum (q–) couplings, can be regarded as truly quantum encodings. The relative entropy of the d–compound and entangled states leads to two different types of entropy for a given quantum state: the von Neumann entropy, which is achieved as the maximum of mutual information over all d–entanglements, and the dimensional entropy, which is achieved at the standard entanglement (true quantum entanglement) coinciding with a d–entanglement only in the case of pure marginal states. The d– and q–information of a quantum noisy channel are, respectively, defined via the input d– and q–encodings, and the q–capacity of a quantum noiseless channel is found to be the logarithm of the dimensionality of the input algebra. The quantum capacity may double the classical capacity, achieved as the supremum over all d–couplings (or encodings) bounded by the logarithm of the dimensionality of a maximal Abelian subalgebra.
Quantum entanglements, describing truly quantum couplings, are studied and classified for discrete compound states. We show that classical-quantum correspondences such as quantum encodings can be treated as d-entanglements leading to a special class of separable compound states. The mutual information for the d-compound and for q-compound (entangled) states leads to two different types of entropies for a given quantum state. The first one is the von Neumann entropy, which is achieved as the supremum of the information over all d-entanglements, and the second one is the dimensional entropy, which is achieved at the standard entanglement, the true quantum entanglement, coinciding with a d-entanglement only in the commutative case. The q-conditional entropy and q-capacity of a quantum noiseless channel, defined as the supremum over all entanglements, is given as the logarithm of the dimensionality of the input von Neumann algebra. It can double the classical capacity, achieved as the supremum over all semiquantum couplings (d-entanglements, or encodings), which is bounded by the logarithm of the dimensionality of a maximal Abelian subalgebra. The entropic measure for essential entanglement is introduced.
The mathematical structure of quantum entanglement is studied and classified from the point of view of quantum compound states. We show that t he classical-quantum correspondences such as encodings can be treated as dia gonal (d-) entanglements. The mutual entropy of the d-compound and entangled states lead to two different types of entropies for a given quantum state: t he von Neumann entropy, which is achieved as the supremum of the information over all d-entanglements, and the dimensional entropy, which is achieved at the standard entanglement, the true quantum entanglement, coinciding with a d-entanglement only in the case of pure marginal states. The q-capacity of a quantum noiseless channel, defined as the supremum over all entanglements, i s given by the logarithm of the dimensionality of the input algebra. It doub les the classical capacity, achieved as the supremum over all d-entanglement s (encodings), which is bounded by the logarithm of the dimensionality of a maximal Abelian subalgebra.