no. 14 · Friday 13 November 2026
Approximate recoverability and the quantum data processing inequality
Abstract
In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et. al. in J. Phys. A: Math. Theor. 48 (2015) is disproved. We prove some inequalities capturing universal approximate recoverability with the Petz recovery map for the sandwiched quasi and Rényi relative entropies for the parameter $t=2$. We also obtain convexity theorems on some parametrized versions of the relative entropy and fidelity, which can be of independent interest.
- comments
- 29 pages, 0 figures Expanded the discussion on the counterexample in page 12. Proved a result demonstrating a class of 2 x 2 qubits satisfying the Seshadreesan-Berta-Wilde conjecture and introduced some further open questions. This is the final published version of the article
- journal
- Rev. Math. Phys. 2650012 (2026)
- fields
- Mathematical Physics