Completely contractive data-processing conjecture for trace-norm conditional mutual information

About 6 years old · traced to

Let E:C→C′\mathcal{E}:C\rightarrow C' be a quantum channel. Define its local trace-norm contraction ratio on CC by

η1,C:=sup⁡ρC,ρC′∥EC[ρC]−EC[ρC′]∥1∥ρC−ρC′∥1.\eta_{1,C}:=\sup_{\rho_C,\rho'_C}\frac{\lVert\mathcal{E}_C[\rho_C]-\mathcal{E}_C[\rho'_C]\rVert_1}{\lVert\rho_C-\rho'_C\rVert_1}.

For a tripartite state ρABC\rho_{ABC}, let I1(A:C∣B)ρI_1(A:C|B)_\rho denote the trace-norm conditional mutual information.

Completely contractive data-processing conjecture for trace-norm conditional mutual information. If

η1,C<1,\eta_{1,C}<1,

then there exists a global constant η<1\eta<1 such that for any tripartite system ABCABC and any state ρABC\rho_{ABC},

I1(A:C′∣B)E(ρ)≤ηI1(A:C∣B)ρ.I_1(A:C'|B)_{\mathcal{E}(\rho)}\leq\eta I_1(A:C|B)_\rho.

This is proposed as a trace-norm analogue of the conditional-mutual-information contraction conjecture. The supplied context does not state whether this formulation is open or known, so its status remains open.

References

Primary source

Chi-Fang Chen, Kohtaro Kato and Fernando G. S. L. Brandão, “Matrix Product Density Operators: when do they have a local parent Hamiltonian?”, arXiv:2010.14682 (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.