ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PXYZP_{XYZ} be a probability distribution. The Renner–Wolf conjecture.

S(X:Y∣∣Z)=I(X:Y↓↓Z).S(X:Y||Z)=I(X:Y \downarrow \downarrow Z).

The reduced intrinsic information is a known upper bound on the secret-key rate and can be strictly smaller than the intrinsic information. Equality would give a simple distribution-based characterization of the secret-key rate; the paper presents this as an open problem.

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.