Manuscript Em03-E@1 · Em03-E-v1.tex · section · c4b07e6a

An executable complete decoder

E5: constructed coherent access and decoder implementation › An executable complete decoder · lines 1580–1595

For ideal whole-block erasure with probability $ℓ$ , decoded by fixed $I_{2} /2$ preparation on erasure, the exact decoded channel is

(1 - ℓ) p Λ_{η} + [1 - (1 - ℓ) p] T .

Its optimal recovery error is

\frac{3 - ( 1 - ℓ ) p - 2 ( 1 - ℓ ) p η}{4} .

The optimality proof is the same orthogonal-sector Bell argument as in Theorem thm:recovery.

Displayed formulas in this passage