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

IEEE International Symposium on Information Theory (ISIT)

Entropy of a Quantum Channel: Definition, Properties, and Application

Gilad Gour, Mark M. Wilde

Published Jun 1, 2020• 3 citations
Publisher

Abstract

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.

DOI
10.1109/isit44484.2020.9174135

Related papers

Entropy in Quantum Probability I

Dėnes Petz

The notion of entropy was introduced by Clausius in order to discuss the thermal behavior of physical systems. After the work of Clausius, Boltzmann, Gibbs and others, the beginning of the exact treatment of entropy was due to von Neumann and Shannon. Their starting point was very di erent, von Neumann was motivated by quantum mechanics and Shannon founded communication theory. The entropy of a state describing a physical system is a quantity expressing the uncertainty or randomness of the system. Shannon regarded this uncertainty attached to a physical system as the amount of information carried by the system, so that the entropy of a state can be read as the information carried by the state. His idea comes from the following consideration: If a physical system has a large uncertainty and one receives information on the system by some procedure, then the so obtained information is more valuable than that received from a system having less uncertainty. It is understood in probability theory that the notion of (Shannon or measure theoretic) entropy has successful applications in a variety of subjects because it determines the asymptotic behavior of certain probabilities in the course of independent trials. First we will discuss this phenomena for nite quantum systems. By a nite quantum system we mean an algebra of matrices which is stable under taking adjoint. (In other words, a nite quantum system is a nite dimensional C*algebra.) If A is such an algebra then there is a linear functional Tr which takes the value 1 at each minimal projection. It is "tracial " in the sense that Tr ab = Tr ba (a; b 2 A) Every functional! on A is determined by a density operator D! 2 A in the form!(a) = Tr D! a (a 2 A): The entropy S(!) of a functional! is de ned by means of its density operator as S(!) = Tr (D!): This notion was introduced by von Neumann in 1927 and we term it von Neumann's entropy or shortly entropy (cf. [1]). In fact, von Neumann de ned the entropy such

QP-PQ, quantum probability and white noise analysis•Jul 1, 1992•2 citations

Conditional entropy and information of quantum processes

Siddhartha Das, Kaumudibikash Goswami, Vivek Pandey

What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$ of the channel $\mathcal{N}_{A'B'\to AB}$ is based on the quantum relative entropy, with system pairs $A',A$ and $B',B$ being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel $\mathcal{N}_{A'B'\to AB}$ in terms of its von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$, to have no causal influence from $A'$ to $B$. As a consequence, if $S[A|B]_{\mathcal{N}}< -\log|A|$ then the channel necessarily has causal influence (signaling) from $A'$ to $B$. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.

arXiv:2410.01740•Oct 2, 2024•13 citations

Relating Entropies of Quantum Channels

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.

arXiv:2106.09629•Entropy•Aug 10, 2021•3 citations

Entropy of a quantum channel

Gilad Gour, Mark M. Wilde

The authors generalize the von Neumann entropy from quantum states to quantum channels, which model evolutions of quantum physical systems, and they provide a physical interpretation of a quantum channel's entropy in terms of an information-processing task called quantum channel merging.

arXiv:1808.06980•Physical Review Research•May 5, 2021•121 citations

Hypothesis testing and entropies of quantum channels

Xiao Yuan

Hypothesis testing is an important task in mathematics and physics. Hypothesis testing of two random variables is related to the Kullback-Leibler divergence of the two corresponding distributions. Similarly, quantum hypothesis testing of two quantum states is characterized by the quantum relative entropy. While a quantum state can be abstracted as a device that only has outputs but no inputs, the most general quantum device is a quantum channel that also has inputs. In this work, we extend hypothesis testing to general quantum channels. In both the one-shot and asymptotic scenario, we study several quantifiers for hypothesis testing under different assumptions of how the channels are used. As the quantifiers are analogs to the quantum relative entropy of states, we call them the quantum relative entropy of channels. Then, we define the entropy of channels based on relative entropies from the target channel to the completely depolarizing channel. We investigate the properties that the quantum relative entropy of channels should satisfy, and we study its interplay with entanglement. With the broad applications of the quantum relative entropy of states, our results can be useful for understanding general properties of quantum channels.

arXiv:1807.05958•Physical Review A•Mar 14, 2019•39 citations

Numerical Calculation of Quantum Mutual Type Entropies

Noboru Watanabe

The quantum entropy was introduced by von Neumann around 1932, which describes the amont of information of the quantum state itself. It was extended by Ohya for C*‐systems. The quantum relative entropy was first defined by Umegaki for σ ‐finite von Neumann algebras, which denotes a certain difference between two states. It was extended by Araki and Uhlmann for general von Neumann algebras and *‐algebras, respectively. The development of communication theory is closely connected with study of entropy theory. In order to discuss the commuinication processes, we need at least two systems, such as input and output systems. The signal of the input system is carried through a physical device, which is called a channel. The mathematical representation of the channel is a mapping from the input state space to the output state space. The mutual entropy (information) defined by using the relative entropy between the product state consist of the input state and the output state and the compound state given by the communication process, expresses the amount of information correctly transmitted through the channel from the input system to the output system. In classical communication theory, the mutual entropy was formulated by using the joint probability distribution between the input system and the output system. The (semi‐classical) mutual entropies for classical input and quantum output were defined by several researchers. In fully quantum system, there does not exist the joint probability distribution in general. Instead of the joint probability distribution, Ohya invented the quantum (Ohya) compound state, and he introduced the fully quantum mutual entropy (information), which is called Ohya mutual entropy, for quantum input and output systems, describes the amount of information correctly sent from the quantum input system to the quantum output system through the quantum channel. It was extended by Ohya for general quantum systems. Recently Shor and Bennet et al took the coherent entropy and defined the mutual type entropy to discuss a sort of coding theorem for communication processes.In this paper, we concretely calculate these mutual entropy‐type measures for the attenuation channel in order to assay these abilities.

AIP conference proceedings•Jan 1, 2006•0 citations
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.
The notion of entropy was introduced by Clausius in order to discuss the thermal behavior of physical systems. After the work of Clausius, Boltzmann, Gibbs and others, the beginning of the exact treatment of entropy was due to von Neumann and Shannon. Their starting point was very di erent, von Neumann was motivated by quantum mechanics and Shannon founded communication theory. The entropy of a state describing a physical system is a quantity expressing the uncertainty or randomness of the system. Shannon regarded this uncertainty attached to a physical system as the amount of information carried by the system, so that the entropy of a state can be read as the information carried by the state. His idea comes from the following consideration: If a physical system has a large uncertainty and one receives information on the system by some procedure, then the so obtained information is more valuable than that received from a system having less uncertainty. It is understood in probability theory that the notion of (Shannon or measure theoretic) entropy has successful applications in a variety of subjects because it determines the asymptotic behavior of certain probabilities in the course of independent trials. First we will discuss this phenomena for nite quantum systems. By a nite quantum system we mean an algebra of matrices which is stable under taking adjoint. (In other words, a nite quantum system is a nite dimensional C*algebra.) If A is such an algebra then there is a linear functional Tr which takes the value 1 at each minimal projection. It is "tracial " in the sense that Tr ab = Tr ba (a; b 2 A) Every functional! on A is determined by a density operator D! 2 A in the form!(a) = Tr D! a (a 2 A): The entropy S(!) of a functional! is de ned by means of its density operator as S(!) = Tr (D!): This notion was introduced by von Neumann in 1927 and we term it von Neumann's entropy or shortly entropy (cf. [1]). In fact, von Neumann de ned the entropy such
What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​ of the channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ is based on the quantum relative entropy, with system pairs A′,AA',AA′,A and B′,BB',BB′,B being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ in terms of its von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​, to have no causal influence from A′A'A′ to BBB. As a consequence, if S[A∣B]N<−log⁡∣A∣S[A|B]_{\mathcal{N}}< -\log|A|S[A∣B]N​<−log∣A∣ then the channel necessarily has causal influence (signaling) from A′A'A′ to BBB. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.
Hypothesis testing is an important task in mathematics and physics. Hypothesis testing of two random variables is related to the Kullback-Leibler divergence of the two corresponding distributions. Similarly, quantum hypothesis testing of two quantum states is characterized by the quantum relative entropy. While a quantum state can be abstracted as a device that only has outputs but no inputs, the most general quantum device is a quantum channel that also has inputs. In this work, we extend hypothesis testing to general quantum channels. In both the one-shot and asymptotic scenario, we study several quantifiers for hypothesis testing under different assumptions of how the channels are used. As the quantifiers are analogs to the quantum relative entropy of states, we call them the quantum relative entropy of channels. Then, we define the entropy of channels based on relative entropies from the target channel to the completely depolarizing channel. We investigate the properties that the quantum relative entropy of channels should satisfy, and we study its interplay with entanglement. With the broad applications of the quantum relative entropy of states, our results can be useful for understanding general properties of quantum channels.
The quantum entropy was introduced by von Neumann around 1932, which describes the amont of information of the quantum state itself. It was extended by Ohya for C*‐systems. The quantum relative entropy was first defined by Umegaki for σ ‐finite von Neumann algebras, which denotes a certain difference between two states. It was extended by Araki and Uhlmann for general von Neumann algebras and *‐algebras, respectively. The development of communication theory is closely connected with study of entropy theory. In order to discuss the commuinication processes, we need at least two systems, such as input and output systems. The signal of the input system is carried through a physical device, which is called a channel. The mathematical representation of the channel is a mapping from the input state space to the output state space. The mutual entropy (information) defined by using the relative entropy between the product state consist of the input state and the output state and the compound state given by the communication process, expresses the amount of information correctly transmitted through the channel from the input system to the output system. In classical communication theory, the mutual entropy was formulated by using the joint probability distribution between the input system and the output system. The (semi‐classical) mutual entropies for classical input and quantum output were defined by several researchers. In fully quantum system, there does not exist the joint probability distribution in general. Instead of the joint probability distribution, Ohya invented the quantum (Ohya) compound state, and he introduced the fully quantum mutual entropy (information), which is called Ohya mutual entropy, for quantum input and output systems, describes the amount of information correctly sent from the quantum input system to the quantum output system through the quantum channel. It was extended by Ohya for general quantum systems. Recently Shor and Bennet et al took the coherent entropy and defined the mutual type entropy to discuss a sort of coding theorem for communication processes.In this paper, we concretely calculate these mutual entropy‐type measures for the attenuation channel in order to assay these abilities.