Recovery map stability for the Data Processing Inequality
Abstract
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 and . Since is CPTP, the DPI says that , 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 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.
Cite
@article{arxiv.1710.02409,
title = {Recovery map stability for the Data Processing Inequality},
author = {Eric A. Carlen and Anna Vershynina},
journal= {arXiv preprint arXiv:1710.02409},
year = {2019}
}
Comments
Version 3 simplifies various parts