Consider the single qubit quantum depolarizing channel, given by
$$T(\rho) = (1- p)\rho + p \frac{\mathbb{I}}{2}. $$
For an $n$ qubit state $\rho$, according to Definition 6.1 of this paper, the channel satisfies a strong data processing inequality, given by:
$$S\left(T^{\otimes n}(\rho) ~||~ \frac{\mathbb{I}}{2^{n}}\right) \leq (1-\alpha)S\left(\rho ~||~ \frac{\mathbb{I}}{2^{n}}\right).$$
$S$ is the von Neumann entropy and the relative entropy $S(A~||~B)$ is given by
$$S(A~||~B) = \text{Tr}(A (\log A - \log B)). $$
Now, consider the quantum amplitude damping channel $\mathcal{A}$, as defined here: $$\mathcal{A}_\gamma(\rho)=\begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix}\rho\begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix}+\begin{pmatrix}0&\sqrt{\gamma}\\0&0\end{pmatrix}\rho\begin{pmatrix}0&0\\\sqrt{\gamma}&0\end{pmatrix}.$$
Is there a known data processing inequality for the same? For example, something like:
$$S\left(\mathcal{A}^{\otimes n}(\rho) ~||~ |0^{n}\rangle \langle 0^{n}| \right) \leq (1-\alpha)S\left(\rho ~||~ |0^{n}\rangle \langle 0^{n}|\right)?$$
(Note that the fixed point of the amplitude damping channel is not the maximally mixed state over $n$ qubits but the all zeros state.)