Manuscript Hawk05-B@1 · Hawk05-B.tex · lemma · f2e5d4f5
Lemma: Replacement and Choi benchmarks
Finite interfaces, reference preservation, and recovery · lines 369–409 · proof included or linked
Hawk05-B@1#lem:benchmarks, Hawk05-B@1#eq:choi
A replacement accessible channel has recovery error ; every accessible channel has recovery error at most . For
put . Then
If , then
Proof. A decoded replacement has Bell output and Bell overlap , giving the lower bound . Preparing attains it. Indeed, depolarization is the uniform average of the Weyl conjugations; separating its identity term gives diamond distance .
The first Choi inequality uses the Bell input. For a pure referenced input, write , where . Then . Its output difference is obtained from the normalized Choi difference by multiplication with on both sides, giving the second inequality. Convexity handles mixed inputs. The final assertion follows by postprocessing contraction and the triangle inequality.
Displayed formulas in this passage
Hawk05-B@1#eq:choi · line 381
unlabeled · line 374
unlabeled · line 388
Nearby in this section
- section: Finite interfaces, reference preservation, and recovery
- definition: Definition: Complete interface
- section: Finite interfaces, reference preservation, and recovery
- lemma: Lemma: Complete restoration and stability
- theorem: Theorem: Exact complete-complement criterion
- section: Finite interfaces, reference preservation, and recovery
- proposition: Proposition: Approximate correction input
- section: Finite interfaces, reference preservation, and recovery