As a peculiar resource of quantum mechanics, quantum correlation has been applied to many aspects. In quantum information processing and quantum computing, the quantum correlation plays an extremely important role, and it has been a subject of further studies, principally due to the general belief that it is a fundamental resource for different quantum information processing tasks. In addition, correlation measure is a very important physical quantity in studying the quantum correlation. A well-defined correlation measure needs to have some necessary properties. By proving these necessary properties, we can deepen our understanding of correlation measure. As one of the key concepts of quantum information theory, relative entropy is always used to measure the uncertainty contained in the state of physical system. In order to better understand the properties and applications of correlation measure based on relative entropy, in this paper, according to the properties of the min relative entropy, we give the quantum correlation measure based on min relative entropy for two-partition and k-partition. Furthermore, we prove that it satisfies some necessary properties of quantum correlation measures, including the nonnegativity, the invariance under local unitary operators, and the monotonicity under completely positive trace-preserving. By proving these properties, we show that the given correlation measure is well-defined. Security of communication has received much attention since ancient times. In today's society, the internet, instant messaging and e-commerce applications are all related to the information security, and the information security is related to the vital interests of everyone. The information encryption is one of the important methods to ensure information security. As an important way to ensure information security, quantum channel has received more and more attention. At the end of the paper, we introduce the concept of quantum channel, and discuss the influence of quantum channel on the correlation measure based on min relative entropy under k-partition. By proposing a new correlation measure and proving the effect quantum channel on the measure, we can better describe the uncertainty contained in the state of physical system.
As a peculiar resource of quantum mechanics, quantum correlation has been applied to many aspects. In quantum information processing and quantum computing, the quantum correlation plays an extremely important role, and it has been a subject of further studies, principally due to the general belief that it is a fundamental resource for different quantum information processing tasks. In addition, correlation measure is a very important physical quantity in studying the quantum correlation. A well-defined correlation measure needs to have some necessary properties. By proving these necessary properties, we can deepen our understanding of correlation measure. As one of the key concepts of quantum information theory, relative entropy is always used to measure the uncertainty contained in the state of physical system. In order to better understand the properties and applications of correlation measure based on relative entropy, in this paper, according to the properties of the min relative entropy, we give the quantum correlation measure based on min relative entropy for two-partition and k-partition. Furthermore, we prove that it satisfies some necessary properties of quantum correlation measures, including the nonnegativity, the invariance under local unitary operators, and the monotonicity under completely positive trace-preserving. By proving these properties, we show that the given correlation measure is well-defined. Security of communication has received much attention since ancient times. In today's society, the internet, instant messaging and e-commerce applications are all related to the information security, and the information security is related to the vital interests of everyone. The information encryption is one of the important methods to ensure information security. As an important way to ensure information security, quantum channel has received more and more attention. At the end of the paper, we introduce the concept of quantum channel, and discuss the influence of quantum channel on the correlation measure based on min relative entropy under k-partition. By proposing a new correlation measure and proving the effect quantum channel on the measure, we can better describe the uncertainty contained in the state of physical system.
The von Neumann entropy is a central concept in physics and information theory, having a number of compelling physical interpretations. There is a certain perspective that the most fundamental notion in quantum mechanics is that of a quantum channel, as quantum states, unitary evolutions, measurements, and discarding of quantum systems can each be regarded as certain kinds of quantum channels. Thus, an important goal is to define a consistent and meaningful notion of the entropy of a quantum channel. Motivated by the fact that the entropy of a state ρ can be formulated as the difference of the number of physical qubits and the “relative entropy distance” between ρ and the maximally mixed state, here we define the entropy of a channel N as the difference of the number of physical qubits of the channel output with the “relative entropy distance” between N and the completely depolarizing channel. We establish that this definition satisfies all of the axioms, recently put forward in [Dour, IEEE Trans. Inf. Theory 65, 5880 (2019)], required for a channel entropy function. The task of quantum channel merging, in which the goal is for the receiver to merge his share of the channel with the environment's share, gives a compelling operational interpretation of the entropy of a channel. We define Rényi and min-entropies of a channel and establish that they satisfy the axioms required for a channel entropy function. Among other results, we also establish that a smoothed version of the min-entropy of a channel satisfies the asymptotic equipartition property.
Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.
The concept of entropy rst arose in the study of thermodynamics and statistical me- chanics. In information theory the so-called Shannon entropy plays a signi cant role, which measures how much information we gain, on average, when we learn the value of a random variable. An alternative interpretation is that the entropy of the random variable quanti es the amount of uncertainty about the random variable before we learn its value. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory of Communication". In the rst part of the present work we consider this fundamental measure of information and show some of its properties, such as non-negativity. The relative entropy or the Kullback-Leibler divergence is a very useful measure of the distance between two prob- ability distributions. After introducing its de nition and other notions (joint entropy, conditional entropy or mutual information) we can prove additional assertions about the Shannon entropy and present statements about the relations between the above men- tioned quantities. In quantum information theory, there is a quantity, namely von Neumann entropy, which corresponds to Shannon entropy and originates from it. In the section Von Neu- mann entropy we will introduce this quantity which is a continuous functional on the states, or on their mathematical representatives, the density operators, and it ful ls in- equalities such as subadditivity and strong subaddititvity. Just as with the Shannon entropy, it is extremely useful to de ne a quantum version of the relative entropy, which is one of the most important numerical quantities appearing in quantum information theory. It is used as a measure of distinguishability between quantum states. Among others its properties are jointly convexity, monotonicity which are speci cally convenient. Transformations on structures which preserve operations, quantities or relations among elements appear in many areas of mathematics. These are the so-called preservers which show up also in physics and even in chemistry where they are usually called symmetries. Therefore, the study of preserver transformations is an important area of research. The third section of this work is based on a paper, in which Lajos Molnár described the structure every bijective map on the space of all density operators on a given Hilbert space, which preserves the relative entropy. This result is closely related to Wigner's famous theorem on the form of quantum mechanical symmetry transformations. The above theorem of Molnár can be extended into two directions. On the one hand, the result holds also in the case when the transformation under consideration acts on the space of all positive semide nite operators not only on density operators (i.e., we omit the condition of unit trace). On the other hand the statement remains valid even if we omit the strongly restrictive condition that the transformation is bijective. The second result is a joint work with Prof. Lajos Molnár which appeared in the journal Linear Algebra and Its Applications.
In this chapter, we discuss several information measures that are important for quantifying the amount of information and correlations that are present in quantum systems. The first fundamental measure that we introduce is the von Neumann entropy (or simply quantum entropy ). It is the quantum generalization of the Shannon entropy, but it captures both classical and quantum uncertainty in a quantum state.1 The quantum entropy gives meaning to the notion of an information qubit . This notion is different from that of the physical qubit, which is the description of a quantum state of an electron or a photon. The information qubit is the fundamental quantum informational unit of measure, determining how much quantum information is present in a quantum system. The initial definitions here are analogous to the classical definitions of entropy, but we soon discover a radical departure from the intuitive classical notions from the previous chapter: the conditional quantum entropy can be negative for certain quantum states. In the classical world, this negativity simply does not occur, but it takes on a special meaning in quantum information theory. Pure quantum states that are entangled have stronger-than-classical correlations and are examples of states that have negative conditional entropy. The negative of the conditional quantum entropy is so important in quantum information theory that we even have a special name for it: the coherent information. We discover that the coherent information obeys a quantum data-processing inequality, placing it on a firm footing as a particular informational measure of quantum correlations. We then define several other quantum information measures, such as quantum mutual information, that bear similar definitions as in the classical world, but with Shannon entropies replaced with quantum entropies. This replacement may seem to make quantum entropy somewhat trivial on the surface, but a simple calculation reveals that a maximally entangled state on two qubits registers two bits of quantum mutual information (recall that the largest the mutual information can be in the classical world is one bit for the case of two maximally correlated bits). We then discuss several entropy inequalities that play an important role in quantum information processing: the monotonicity of quantum relative entropy, strong subadditivity, the quantum data-processing inequalities, and continuity of quantum entropy.
Chapter 7 discusses quantum conditional entropy, extending the concept of conditional majorization and introducing the notion of negative quantum conditional entropy. The chapter starts with the basic definition of conditional entropy, exploring its key properties like monotonicity and additivity. It further delves into the concepts of conditional min- and max-entropies, emphasizing their roles in quantifying uncertainty in quantum states and their operational significance in quantum information theory. The text presents conditional entropy as a measure sensitive to the effects of entanglement, showing that negative conditional entropy is a distinctive feature of quantum systems, contrasting with the classical domain where entropy values are nonnegative. This negativity is particularly pronounced in the context of maximally entangled states and is connected to the fundamental differences between classical and quantum information processing. Moreover, the chapter includes theorems and exercises to solidify understanding, like the invariance of conditional entropy under local isometric channels and its reduction to entropy for product states. It concludes by underscoring the inevitability of negative conditional entropy in quantum systems, a topic of both theoretical and practical importance in the quantum domain.
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.