ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X1X_1 and X2X_2 be binary classical random variables with quantum side-information systems B1B_1 and B2B_2, respectively, and let ρX1B1\rho^{X_1B_1} and ρX2B2\rho^{X_2B_2} be classical-quantum states. Define

H1=H(X1∣B1),H2=H(X2∣B2).H_1=H(X_1|B_1),\qquad H_2=H(X_2|B_2).

Here, hh is the binary entropy function, h−1h^{-1} denotes its inverse on [0,1/2][0,1/2], and ∗\ast denotes binary convolution. Quantum Mrs. Gerber's Lemma. The conditional entropy of the binary sum satisfies

H(X1+X2∣B1B2)≥{h(h−1(H1)∗h−1(H2)),H1+H2≤log⁡2,H1+H2−log⁡2+h(h−1(log⁡2−H1)∗h−1(log⁡2−H2)),H1+H2≥log⁡2.H(X_1+X_2|B_1B_2)\geq \begin{cases} h\bigl(h^{-1}(H_1)\ast h^{-1}(H_2)\bigr),&H_1+H_2\leq\log 2,\\ H_1+H_2-\log 2+h\bigl(h^{-1}(\log 2-H_1)\ast h^{-1}(\log 2-H_2)\bigr),&H_1+H_2\geq\log 2. \end{cases}

This conjecture is the quantum-side-information analogue of Mrs. Gerber's Lemma and would give the optimal lower bound for information combining. Its status is not resolved in the supplied source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.