Manuscript Hawk07-A@1 · Hawk07-A.tex · theorem · f9c0f5da
Theorem: Exact whole-code recovery
Complete restoration and the complement criterion · lines 475–541 · proof included or linked
Hawk07-A@1#thm:exact, Hawk07-A@1#eq:normalform, Hawk07-A@1#eq:exactdecoder
For ,
If , then
There are an isometry and a state such that
An exact decoder on the entire accessible space is
Proof. Suppose a decoder is exact and dilate it by . The isometry dilates the identity. Its Choi operator has rank one, so every Kraus operator is proportional to identity. Therefore
with fixed . Tracing proves complement constancy.
Conversely, diagonalize
and write
The identities give
These orthonormal vectors define . Equations (eq:normalform) and (eq:exactdecoder) follow. The decoder is CP, its two trace contributions sum to , and it recovers every matrix unit.
Displayed formulas in this passage
Hawk07-A@1#eq:normalform · line 491
Hawk07-A@1#eq:exactdecoder · line 496
unlabeled · line 478
unlabeled · line 486
unlabeled · line 511
unlabeled · line 519
unlabeled · line 524
unlabeled · line 532
Nearby in this section
- proposition: Proposition: Complete restoration
- section: Complete restoration and the complement criterion
- section: Complete restoration and the complement criterion
- example: Example: One observable is not the diary
- lemma: Lemma: Approximate correction and replacement benchmarks
- section: Complete restoration and the complement criterion