Quantum relative entropy

In quantum information theory, quantum relative entropy is a measure of distinguishability between two quantum states. It is the quantum mechanical analog of relative entropy.

Motivation

For simplicity, it will be assumed that all objects in the article are finite-dimensional.

We first discuss the classical case. Suppose the probabilities of a finite sequence of events is given by the probability distribution P = {p₁...p_n}, but somehow we mistakenly assumed it to be Q = {q₁...q_n}. For instance, we can mistake an unfair coin for a fair one. According to this erroneous assumption, our uncertainty about the j-th event, or equivalently, the amount of information provided after observing the j-th event, is

$\;-\log q_{j}.$

The (assumed) average uncertainty of all possible events is then

$\;-\sum _{j}p_{j}\log q_{j}.$

On the other hand, the Shannon entropy of the probability distribution p, defined by

$\;-\sum _{j}p_{j}\log p_{j},$

is the real amount of uncertainty before observation. Therefore the difference between these two quantities

$\;-\sum _{j}p_{j}\log q_{j}-\left(-\sum _{j}p_{j}\log p_{j}\right)=\sum _{j}p_{j}\log p_{j}-\sum _{j}p_{j}\log q_{j}$

is a measure of the distinguishability of the two probability distributions p and q. This is precisely the classical relative entropy, or Kullback–Leibler divergence:

$D_{{{\mathrm {KL}}}}(P\|Q)=\sum _{j}p_{j}\log {\frac {p_{j}}{q_{j}}}\!.$

Note

1. In the definitions above, the convention that 0·log 0 = 0 is assumed, since lim_x → 0 x log x = 0. Intuitively, one would expect that an event of zero probability to contribute nothing towards entropy.
2. The relative entropy is not a metric. For example, it is not symmetric. The uncertainty discrepancy in mistaking a fair coin to be unfair is not the same as the opposite situation.

Definition

As with many other objects in quantum information theory, quantum relative entropy is defined by extending the classical definition from probability distributions to density matrices. Let ρ be a density matrix. The von Neumann entropy of ρ, which is the quantum mechanical analog of the Shannon entropy, is given by

$S(\rho )=-\operatorname {Tr}\rho \log \rho .$

For two density matrices ρ and σ, the quantum relative entropy of ρ with respect to σ is defined by

$S(\rho \|\sigma )=-\operatorname {Tr}\rho \log \sigma -S(\rho )=\operatorname {Tr}\rho \log \rho -\operatorname {Tr}\rho \log \sigma =\operatorname {Tr}\rho (\log \rho -\log \sigma ).$

We see that, when the states are classically related, i.e. ρσ = σρ, the definition coincides with the classical case.

Non-finite relative entropy

In general, the support of a matrix M is the orthogonal complement of its kernel, i.e. supp(M):=ker(M)^⊥. When considering the quantum relative entropy, we assume the convention that −s · log 0 = ∞ for any s > 0. This leads to the definition that

$S(\rho \|\sigma )=\infty$

when

${\text{supp}}(\rho )\cap {\text{ker}}(\sigma )\neq 0.$

This makes physical sense. Informally, the quantum relative entropy is a measure of our ability to distinguish two quantum states. But orthogonal quantum states can always be distinguished via projective measurements. In the present context, this is reflected by non-finite quantum relative entropy.

In the interpretation given in the previous section, if we erroneously assume the state ρ has support in ker(σ), this is an error impossible to recover from.

Non-negativity of relative entropy

Corresponding classical statement

For the classical Kullback–Leibler divergence, it can be shown that

$D_{{{\mathrm {KL}}}}(P\|Q)=\sum _{j}p_{j}\log {\frac {p_{j}}{q_{j}}}\geq 0,$

and the equality holds if and only if P = Q. Colloquially, this means that the uncertainty calculated using erroneous assumptions is always greater than the real amount of uncertainty.

To show the inequality, we rewrite

$D_{{{\mathrm {KL}}}}(P\|Q)=\sum _{j}p_{j}\log {\frac {p_{j}}{q_{j}}}=\sum _{j}(-\log {\frac {q_{j}}{p_{j}}})(p_{j}).$

Notice that log is a concave function. Therefore -log is convex. Applying Jensen's inequality, we obtain

$D_{{{\mathrm {KL}}}}(P\|Q)=\sum _{j}(-\log {\frac {q_{j}}{p_{j}}})(p_{j})\geq -\log(\sum _{j}{\frac {q_{j}}{p_{j}}}p_{j})=0.$

Jensen's inequality also states that equality holds if and only if, for all i, q_i = (∑q_j) p_i, i.e. p = q.

The result

Klein's inequality states that the quantum relative entropy

$S(\rho \|\sigma )=\operatorname {Tr}\rho (\log \rho -\log \sigma ).$

is non-negative in general. It is zero if and only ρ = σ.

Proof

Let ρ and σ have spectral decompositions

$\rho =\sum _{i}p_{i}v_{i}v_{i}^{*}\;,\;\sigma =\sum _{i}q_{i}w_{i}w_{i}^{*}.$

So

$\log \rho =\sum _{i}(\log p_{i})v_{i}v_{i}^{*}\;,\;\log \sigma =\sum _{i}(\log q_{i})w_{i}w_{i}^{*}.$

Direct calculation gives

$S(\rho \|\sigma )$

$=\sum _{k}p_{k}\log p_{k}-\sum _{{i,j}}(p_{i}\log q_{j})|v_{i}^{*}w_{j}|^{2}$

$=\sum _{i}p_{i}(\log p_{i}-\sum _{j}\log q_{j}|v_{i}^{*}w_{j}|^{2})$

$\;=\sum _{i}p_{i}(\log p_{i}-\sum _{j}(\log q_{j})P_{{ij}}),$

where P_{i j} = |v_i*w_j|².

Since the matrix (P_{i j})_{i j} is a doubly stochastic matrix and -log is a convex function, the above expression is

${\displaystyle \geq \sum _{i}p_{i}(\log p_{i}-\log(\sum _{j}q_{j}P_{ij})).}$

Define r_i = ∑_jq_j P_{i j}. Then {r_i} is a probability distribution. From the non-negativity of classical relative entropy, we have

$S(\rho \|\sigma )\geq \sum _{i}p_{i}\log {\frac {p_{i}}{r_{i}}}\geq 0.$

The second part of the claim follows from the fact that, since -log is strictly convex, equality is achieved in

$\sum _{i}p_{i}(\log p_{i}-\sum _{j}(\log q_{j})P_{{ij}})\geq \sum _{i}p_{i}(\log p_{i}-\log(\sum _{j}q_{j}P_{{ij}}))$

if and only if (P_{i j}) is a permutation matrix, which implies ρ = σ, after a suitable labeling of the eigenvectors {v_i} and {w_i}.

Joint convexity of relative entropy

The relative entropy is jointly convex. For ${\displaystyle 0\leq \lambda \leq 1}$ and states ${\displaystyle \rho _{1(2)},\sigma _{1(2)}}$ we have

${\displaystyle D(\lambda \rho _{1}+(1-\lambda )\rho _{2}\|\lambda \sigma _{1}+(1-\lambda )\sigma _{2})\leq \lambda D(\rho _{1}\|\sigma _{1})+(1-\lambda )D(\rho _{2}\|\sigma _{2})}$

Monotonicity of relative entropy

The relative entropy decreases monotonically under completely positive trace preserving (CPTP) operations ${\mathcal {N}}$ on density matrices,

${\displaystyle S({\mathcal {N}}(\rho )\|{\mathcal {N}}(\sigma ))\leq S(\rho \|\sigma )}$.

This inequality is called Monotonicity of quantum relative entropy.

An entanglement measure

Let a composite quantum system have state space

$H=\otimes _{k}H_{k}$

and ρ be a density matrix acting on H.

The relative entropy of entanglement of ρ is defined by

$\;D_{{{\mathrm {REE}}}}(\rho )=\min _{{\sigma }}S(\rho \|\sigma )$

where the minimum is taken over the family of separable states. A physical interpretation of the quantity is the optimal distinguishability of the state ρ from separable states.

Clearly, when ρ is not entangled

$\;D_{{{\mathrm {REE}}}}(\rho )=0$

by Klein's inequality.

Computing relative entropy of entanglement is NP-complete.^[1]

Relation to other quantum information quantities

One reason the quantum relative entropy is useful is that several other important quantum information quantities are special cases of it. Often, theorems are stated in terms of the quantum relative entropy, which lead to immediate corollaries concerning the other quantities. Below, we list some of these relations.

Let ρ_AB be the joint state of a bipartite system with subsystem A of dimension n_A and B of dimension n_B. Let ρ_A, ρ_B be the respective reduced states, and I_A, I_B the respective identities. The maximally mixed states are I_A/n_A and I_B/n_B. Then it is possible to show with direct computation that

$S(\rho _{{A}}||I_{{A}}/n_{A})={\mathrm {log}}(n_{A})-S(\rho _{{A}}),\;$

$S(\rho _{{AB}}||\rho _{{A}}\otimes \rho _{{B}})=S(\rho _{{A}})+S(\rho _{{B}})-S(\rho _{{AB}})=I(A:B),$

$S(\rho _{{AB}}||\rho _{{A}}\otimes I_{{B}}/n_{B})={\mathrm {log}}(n_{B})+S(\rho _{{A}})-S(\rho _{{AB}})={\mathrm {log}}(n_{B})-S(B|A),$

where I(A:B) is the quantum mutual information and S(B|A) is the quantum conditional entropy.

References

1. Huang, Yichen (21 March 2014). "Computing quantum discord is NP-complete". New Journal of Physics. 16 (3): 033027. arXiv:1305.5941. Bibcode:2014NJPh...16c3027H. doi:10.1088/1367-2630/16/3/033027.

• Vedral V., 2002, Rev. Mod. Phys. 74, 197 , eprint quant-ph/0102094