An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki-Umegaki (a-type) and of Belavkin-Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum channel capacities via entanglement, which extends the earlier results of V. P. Belavkin to products of arbitrary quantum channels for quantum relative entropy of any type.
An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki-Umegaki (a-type) and of Belavkin-Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum channel capacities via entanglement, which extends the earlier results of V. P. Belavkin to products of arbitrary quantum channels for quantum relative entropy of any type.
An elementary introduction into algebraic approach to unified quantum information theory and operational approach to quantum entanglement as generalized encoding is given. After introducing compound quantum state and two types of informational divergences, namely, Araki–Umegaki (a-type) and of Belavkin–Staszewski (b-type) quantum relative entropic information, this paper treats two types of quantum mutual information via entanglement and defines two types of corresponding quantum channel capacities as the supremum via the generalized encodings. It proves the additivity property of quantum channel capacities via entanglement, which extends the earlier results of Belavkin to products of arbitrary quantum channels for quantum relative entropy of any type.
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 pure quantum entanglement is generalized to the case of mixed compound states to include the classical and quantum encodings as particular cases. The true quantum entanglements are characterized as transpose-CP but not CP maps. The entangled information is introduced as the relative entropy of the mutual and the input state and total information of the entangled states leads to two different types of entropy for a given quantum state: the von Neumann entropy, which is achieved as the supremum of the information over all c-entanglements, and the true quantum entropy, which is achieved at the standard entanglement. The q-capacity, defined as the supremum over all entanglements, doubles the c-capacity in the case of the simple algebra. The conditional q-entropy is positive, and q-information of a quantum channel is additive.
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 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.
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.