ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XYZXYZ be the distribution displayed in the source, depending on a parameter aa. The candidate-distribution binarization conjecture. There exists a value aa such that, for every binarization channel PX‾∣XP_{\overline{X}|X} and PY‾∣YP_{\overline{Y}|Y}, there exists a channel PZ‾∣ZP_{\overline{Z}|Z} satisfying

(XN‾⊥ ⁣ ⁣ ⁣⊥YN‾)∣ZN‾(\overline{X^N}\perp\!\!\!\perp\overline{Y^N})\mid\overline{Z^N}

for every N≥1N\geq1, where the channels processing XNX^N and YNY^N are binarizations. This is proposed as a route to proving that the displayed distribution has zero secret-key rate despite positive intrinsic information; the source does not resolve the conjecture.

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.