Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the concept of majorization serves as a fundamental tool for comparing the uncertainty inherent in both classical and quantum systems. This paper establishes a rigorous framework for assessing the uncertainty in both classical and quantum channels. By employing a specific class of superchannels, we introduce and elucidate three distinct approaches to channel majorization: constructive, axiomatic, and operational. Intriguingly, these methodologies converge to a consistent ordering. This convergence not only provides a robust basis for defining entropy functions for channels but also clarifies the interpretation of entropy in this broader context. Most notably, our findings reveal that any viable entropy function for quantum channels must assume negative values, thereby challenging traditional notions of entropy.
Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the concept of majorization serves as a fundamental tool for comparing the uncertainty inherent in both classical and quantum systems. This paper establishes a rigorous framework for assessing the uncertainty in both classical and quantum channels. By employing a specific class of superchannels, we introduce and elucidate three distinct approaches to channel majorization: constructive, axiomatic, and operational. Intriguingly, these methodologies converge to a consistent ordering. This convergence not only provides a robust basis for defining entropy functions for channels but also clarifies the interpretation of entropy in this broader context. Most notably, our findings reveal that any viable entropy function for quantum channels must assume negative values, thereby challenging traditional notions of 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.
In this thesis, I studied a mathematical development to define and quantify the uncertainty inherent in classical channels. This thesis starts with the introduction and background on how to formally think about uncertainty in the domain of classical states. The concept of probability vector majorization and its variants, relative majorization and conditional majorization, are reviewed. This thesis introduces three conceptually distinct approaches to formalize the notion of uncertainty inherent in classical channels. These three approaches define the same preordering on the domain of classical channels, leading to characterizations from many perspectives. With the solid foundation of uncertainty comparison, classical channel entropy is then defined to be an additive monotone with respect to the majorization relation. The well-known entropies in the domain of classical states are uniquely extended to the domain of channels via the optimal extensions, providing not only a solid foundation but also the quantifiers of uncertainty inherent in classical channels.
The von Neumann entropy of a quantum state 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 prove that this definition satisfies all of the axioms, recently put forward by Gour [IEEE Trans. Inf. Theory 65, 5880 (2019)IETTAW0018-944810.1109/TIT.2019.2907989], 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. The entropy of a channel can be negative for certain channels, but this negativity has an operational interpretation in terms of the channel merging protocol. We define Rényi and min-entropies of a channel and prove that they satisfy the axioms required for a channel entropy function. Among other results, we also prove that a smoothed version of the min-entropy of a channel satisfies the asymptotic equipartition property.
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of “quantum majorization” from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.
The crucial role of channels in physics and information theory motivates the task of characterizing the entropy, or uncertainty, of a channel. Games of chance become a natural candidate for this task, as a system's performance in a gambling game depends solely on the uncertainty of its output. In this work, we construct families of games that induce preorders corresponding to majorization, conditional majorization, and channel majorization. Finally, we provide operational interpretations for all preorders, show the relevance of these results to dynamical resource theories, and find the only asymptotically continuous classical channel entropy.
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.