The Data Processing Inequality (DPI) says that the Umegaki relative entropy is non-increasing under the action of completely positive trace preserving (CPTP) maps. Let be a finite dimensional von Neumann algebra and a von Neumann subalgebra if it. Let be the tracial conditional expectation from onto . For density matrices and in , let $\rho_{\mathcal N} := {\mathcal E}\tau \rho\sigma{\mathcal N} := {\mathcal E}\tau \sigma$. Since is CPTP, the DPI says that $S(\rho||\sigma) \geq S(\rho{\mathcal N}||\sigma_{\mathcal N})$, and the general case is readily deduced from this. A theorem of Petz says that there is equality if and only if , where is the Petz recovery map, which is dual to the Accardi-Cecchini coarse graining operator from to . In it simplest form, our bound is where is the relative modular operator. We also prove related results for various quasi-relative entropies. Explicitly describing the solutions set of the Petz equation $\sigma = {\mathcal R}\rho(\sigma{\mathcal N} )$ amounts to determining the set of fixed points of the Accardi-Cecchini coarse graining map. Building on previous work, we provide a throughly detailed description of the set of solutions of the Petz equation, and obtain all of our results in a simple self, contained manner.

生成讲解博客的中文版本

生成AI智能校验的中文版本