The BSC-PSC bound for sandwiched Rényi conditional entropy

Let X1,X2X_1,X_2 be binary random variables with quantum side information B1,B2B_1,B_2, let ρ1,ρ2\rho_1,\rho_2 denote their respective classical–quantum states, and let X1+X2X_1+X_2 be their sum modulo two in the product state τ\tau. Write

H1=H~α(X1B1)ρ1,H2=H~α(X2B2)ρ2.H_1=\widetilde H_\alpha^\downarrow(X_1|B_1)_{\rho_1},\qquad H_2=\widetilde H_\alpha^\downarrow(X_2|B_2)_{\rho_2}.

Here hαh_\alpha is the binary Rényi entropy and hα1h_\alpha^{-1} its inverse on the relevant interval, while \ast denotes binary convolution. The BSC-PSC bound. For α(0,2][3,)\alpha\in(0,2]\cup[3,\infty),

H~α(X1+X2B1B2)τ{hα(hα1(H1)hα1(H2)),H1+H2log2,H1+H2log2+hα(hα1(log2H1)hα1(log2H2)),H1+H2log2.\widetilde H_\alpha^\downarrow(X_1+X_2|B_1B_2)_\tau\geq\begin{cases} h_\alpha\bigl(h_\alpha^{-1}(H_1)\ast h_\alpha^{-1}(H_2)\bigr),&H_1+H_2\leq\log 2,\\ H_1+H_2-\log 2+h_\alpha\bigl(h_\alpha^{-1}(\log 2-H_1)\ast h_\alpha^{-1}(\log 2-H_2)\bigr),&H_1+H_2\geq\log 2.\end{cases}

For α[2,3]\alpha\in[2,3], the same statement holds with \geq replaced by \leq; for α{2,3}\alpha\in\{2,3\}, equality holds. If true, the bounds are tight, with equality achieved by binary symmetric and pure-state channels, but their validity for general α\alpha remains unresolved.

Sources & referencesView supporting material

Primary source

Christoph Hirche, Xinyue Guan and Marco Tomamichel, “Chain Rules for Renyi Information Combining”, arXiv:2305.02589 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.