Manuscript Hawk04-C@1 · Hawk04-C-v1.tex · theorem · 94d46352
Theorem: Sharp classical-record recovery bound
Row 6: thermality, classical records, and information loss › The record-only obstruction · lines 1243–1310 · proof included or linked
Hawk04-C@1#thm:classical, Hawk04-C@1#eq:record-channel, Hawk04-C@1#eq:classical-bound
Let a channel from retain only a finite classical record:
For every CPTP decoder ,
The same bound holds for every measure-and-prepare channel. It is sharp: computational readout followed by computational-basis preparation attains it.
Proof. Write . Then
Its normalized Choi state is
which is separable across . For normalized product vectors,
by Cauchy–Schwarz. Convexity gives . Testing the Bell projection therefore gives
This is one admissible referenced channel test, proving (eq:classical-bound). The argument already covers a general measure-and-prepare output.
For sharpness, let
Computational dephasing satisfies
Hence
The lower bound already proved gives equality after dividing by two.
Displayed formulas in this passage
Hawk04-C@1#eq:record-channel · line 1246
Hawk04-C@1#eq:classical-bound · line 1255
unlabeled · line 1267
unlabeled · line 1271
unlabeled · line 1278
unlabeled · line 1285
unlabeled · line 1293
unlabeled · line 1297
unlabeled · line 1301