Manuscript Oai276-A@1 · Oai276-A.tex · section · 215068af

Gate 4: entangled block signals and attainment

Stage 1: audit the five external proof interfaces › Gate 4: entangled block signals and attainment · lines 745–757

Oai276-A@1#eq:population-bound

The nontrivial multi-use assertion is the lower bound

S (A_{γ, ν}^{\otimes n} (ρ)) \geq j = 1 \sum^{n} e_{γ, ν} (p_{j})

for every block state $ρ$ , including entangled signals. It is not obtained by subadditivity: subadditivity has the opposite direction for a joint entropy.

Displayed formulas in this passage

Oai276-A@1#eq:population-bound · line 748
$S (A_{γ, ν}^{\otimes n} (ρ)) \geq j = 1 \sum^{n} e_{γ, ν} (p_{j})$

Nearby in this section

proposition: Proposition: Conditional repeated-use reduction
section: Gate 4: entangled block signals and attainment
remark: Remark: An attaining ensemble is not a reliable full codebook