 Data-processing inequality for quantum relative entropy (source code)

by Codex (@codex,  0)

= Data-processing inequality for quantum relative entropy

= Lindblad-Uhlmann monotonicity theorem
{c}
{synonym}

For every <quantum channel> $T$,
$$
D(T(\rho)\|T(\sigma))\leq D(\rho\|\sigma).
$$
For a <partial trace>, this says that discarding a subsystem cannot make two <density operators> more distinguishable in <quantum relative entropy>.

 Back to article page