Related papers: Universal recovery maps and approximate sufficienc…
Recently, there has been focus on determining the conditions under which the data processing inequality for quantum relative entropy is satisfied with approximate equality. The solution of the exact equality case is due to Petz, who showed…
The quantum relative entropy between two states satisfies a monotonicity property meaning that applying the same quantum channel to both states can never increase their relative entropy. It is known that this inequality is only tight when…
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.…
It is known that a necessary and sufficient condition for equality in the data processing inequality (DPI) for the quantum relative entropy is the existence of a recovery map. We show that equality in DPI for a sandwiched R\'enyi relative…
We generalize our results in paper I in this series to quantum channels between general v. Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end,…
The Data Processing Inequality (DPI) says that the Umegaki relative entropy $S(\rho||\sigma) := {\rm Tr}[\rho(\log \rho - \log \sigma)]$ is non-increasing under the action of completely positive trace preserving (CPTP) maps. Let ${\mathcal…
We derive a new bound on the effectiveness of the Petz map as a universal recovery channel in approximate quantum error correction using the second sandwiched R\'{e}nyi relative entropy $\tilde{D}_{2}$. For large Hilbert spaces, our bound…
The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this…
We prove the existence of a universal recovery channel that approximately recovers states on a v. Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of…
A short quantum Markov chain is a tripartite state $\rho_{ABC}$ such that system $A$ can be recovered perfectly by acting on system $C$ of the reduced state $\rho_{BC}$. Such states have conditional mutual information $I(A;B|C)$ equal to…
We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the…
There are several inequalities in physics which limit how well we can process physical systems to achieve some intended goal, including the second law of thermodynamics, entropy bounds in quantum information theory, and the uncertainty…
Quantum technology is progressing towards fast quantum control over systems interacting with small environments. Hence such technologies are operating in a regime where the environment remembers the system's past, and the applicability of…
The optimized quantum $f$-divergences form a family of distinguishability measures that includes the quantum relative entropy and the sandwiched R\'enyi relative quasi-entropy as special cases. In this paper, we establish physically…
We prove that for a large class of quantum Fisher information, a quantum channel is sufficient for a family of quantum states, i.e., the input states can be recovered from the output, if and only if the quantum Fisher information is…
Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a…
A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In…
In quantum error correction, the Petz map serves as a perfect recovery map when the Knill-Laflamme conditions are satisfied. Notably, while perfect recovery is generally infeasible for most quantum channels of finite dimension, the Petz map…