Manuscript Hawk01-B@1 · Hawk01-B.tex · theorem · cfa976f1

Theorem: Exact entropy and reference-information ledger

Exact recovery, leakage, and reference correlations › Entropy and mutual information · lines 1065–1107 · proof included or linked

Hawk01-B@1#thm:information, Hawk01-B@1#eq:radiationentropy, Hawk01-B@1#eq:residualentropy, Hawk01-B@1#eq:MIradiation, Hawk01-B@1#eq:MIresidual, Hawk01-B@1#eq:CMIincrement

Back to manuscript

For an arbitrary code state and ,

For the input ,

The key emission has .

Proof. In (eq:accessibleprefix), completed blocks have conditional entropy , pending blocks have entropy zero, and the classical key has entropy . The orthogonal branch labels contribute . This proves (eq:radiationentropy). The complementary channel has the opposite placement of the logical state, proving (eq:residualentropy).

For the Bell input, and the global state is pure. Therefore

and the complementary identity gives . The conditional mutual information is the difference of successive reference–radiation mutual informations. Since , (eq:CMIincrement) follows.

Displayed formulas in this passage

  • Hawk01-B@1#eq:radiationentropy · line 1068

  • Hawk01-B@1#eq:residualentropy · line 1068

  • Hawk01-B@1#eq:MIradiation · line 1077

  • Hawk01-B@1#eq:MIresidual · line 1077

  • Hawk01-B@1#eq:CMIincrement · line 1077

  • unlabeled · line 1100

Nearby in this section