Manuscript Hawk04-C@1 · Hawk04-C-v1.tex · theorem · 94d46352
Theorem: Complete-output restoration
Local preservation and exact full-code recovery · lines 317–376 · proof included or linked
Hawk04-C@1#thm:global, Hawk04-C@1#eq:global-decoder, Hawk04-C@1#eq:isometric-trace-norm
For (eq:interface), choose any and put . The map
is CPTP and satisfies
For every operator on ,
Thus all logical matrix units and all referenced state distinctions are preserved on the complete output. For a maximally entangled code–reference input, the complete output has
Proof. The first term of (eq:global-decoder) is a completely positive compression. The second is a positive-effect measurement followed by preparation of , hence is completely positive. Their traces sum to
On , the second term vanishes and the first returns . This proves the left-inverse identity on all operators.
An isometry preserves all nonzero singular values of an operator under left and right embedding. The same is true of , proving (eq:isometric-trace-norm). The statement about matrix units also follows directly from the left inverse.
Finally, let
The state is pure with equal Schmidt coefficients. Its and entropies are both , and its joint entropy vanishes.
Displayed formulas in this passage
Hawk04-C@1#eq:global-decoder · line 322
Hawk04-C@1#eq:isometric-trace-norm · line 333
unlabeled · line 329
unlabeled · line 342
unlabeled · line 353
unlabeled · line 367
Nearby in this section
- section: Local preservation and exact full-code recovery
- theorem: Theorem: Exact complete-complement criterion
- section: Local preservation and exact full-code recovery
- corollary: Corollary: The precise no-hiding conclusion
- corollary: Corollary: A strict finite-dimensional obstruction
- remark: Remark: The information target matters