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

Proposition: Exact erasure optimum

Observer access: coherence, destructive measurement, and loss › A declared whole-output erasure model · lines 1803–1820 · proof included or linked

Hawk01-B@1#prop:erasure, Hawk01-B@1#eq:erasureoptimum

Back to manuscript

For the constructed prefix,

ϵ_{rec} (E_{η} N_{t}) = (1 - η p_{t}) c_{d} .

At the endpoint this becomes $(1 - η) c_{d}$ .

Proof. An intact completed branch has total weight $η p_{t}$ and permits perfect recovery. Every other accessible branch is constant. The branchwise Bell bound and decoder of Theorem thm:optima apply with success probability $η p_{t}$ .

Displayed formulas in this passage

Hawk01-B@1#eq:erasureoptimum · line 1806
$ϵ_{rec} (E_{η} N_{t}) = (1 - η p_{t}) c_{d} .$

Nearby in this section

section: A declared whole-output erasure model
section: A declared whole-output erasure model