2000 character limit reached
More on a trace inequality in quantum information theory
Published 1 Dec 2015 in quant-ph, cs.IT, and math.IT | (1512.00226v1)
Abstract: It is known that for a completely positive and trace preserving (cptp) map ${\cal N}$, $\text{Tr}$ $\exp$${ \log \sigma$ $+$ ${\cal N}\dagger [\log {\cal N}(\rho)$ $-\log {\cal N}(\sigma)] }$ $\leqslant$ $\text{Tr}$ $\rho$ when $\rho$, $\sigma$, ${\cal N}(\rho)$, and ${\cal N}(\sigma)$ are strictly positive. We state and prove a relevant version of this inequality for the hitherto unaddressed case of these matrices being nonnegative. Our treatment also provides an alternate proof for the strictly positive case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.