Manuscript Hawk07-A@1 · Hawk07-A.tex · theorem · f9c0f5da
Theorem: Three retained cuts with one fixed receiver
Existence with a nontrivial window and turnover · lines 1288–1376 · proof included or linked
Hawk07-A@1#thm:joint, Hawk07-A@1#eq:size, Hawk07-A@1#eq:riseandfall, Hawk07-A@1#eq:failure
Take
Declare
The three cuts have
If
then a set of Haar unitaries of measure at least satisfies all of the following:
for every ;
the fixed decoder policy (eq:fixedpolicy) has half-diamond error at most at all three cuts;
for the fixed pure diary input,
every append-only destructive record is nondecreasing;
the cutoff retains one physical vault qubit.
The ensemble mean also rises and falls strictly at these three cuts.
Proof. At , (eq:K) gives
Hence, under (eq:size),
At the intermediate cut,
Markov's inequality gives
Therefore an event of probability greater than has
At , rank is at most . At , rank is at most . Their entropy upper bounds hold for every unitary.
Subtracting the leakage failure set from the turnover event leaves measure greater than , hence at least . Nested monotonicity and Theorem thm:decoder prove (i)–(ii). Proposition prop:record gives (iv), and gives (v).
Finally,
The mean entropy lower bound in Theorem thm:entropy is therefore strictly greater than at the intermediate cut, whereas both neighboring mean entropies are at most that value.
Displayed formulas in this passage
Hawk07-A@1#eq:size · line 1305
Hawk07-A@1#eq:riseandfall · line 1317
unlabeled · line 1291
unlabeled · line 1295
unlabeled · line 1299
unlabeled · line 1331
Hawk07-A@1#eq:failure · line 1335
unlabeled · line 1342
unlabeled · line 1348
unlabeled · line 1357
unlabeled · line 1370