Manuscript VIII-B@3 · VIII-B-v3.tex · proposition · 3aa6baa1
Proposition: Exact full-code criterion
Classical table decoding is not quantum recovery › Full-code recovery and the complete complement · lines 2149–2201 · proof included or linked
VIII-B@3#prop:complement
Let be a channel with Kraus operators . The following are equivalent:
a channel satisfies ;
for scalar coefficients;
a complete complementary channel is a replacement channel, for a fixed state .
The criterion concerns recovery of the whole input matrix algebra, not merely a subsystem.
Proof. The standard complementary channel has matrix entries
This proves equivalence of (ii) and (iii).
If are Kraus operators of a left inverse, the operators form a Kraus family for the identity channel. Its Choi matrix has rank one, so each . Trace preservation of then gives
Conversely, diagonalize the positive scalar matrix in (ii) by a Kraus-basis change. Remove zero Kraus operators and write
The isometry ranges are orthogonal. Put and choose a fixed state on . Then
is completely positive and trace preserving, and .
Displayed formulas in this passage
unlabeled · line 2167
unlabeled · line 2178
unlabeled · line 2186
unlabeled · line 2194