Manuscript Oai290-A@1 · Oai290-A.tex · theorem · 7c6e104a
Theorem: Complete-complement criterion
Exact full-code recovery and its obstructions · lines 347–426 · proof included or linked
Oai290-A@1#thm:exact, Oai290-A@1#eq:constantcomplement, Oai290-A@1#eq:rankcapacity
For (eq:isometry)–(eq:channels), the following are equivalent:
there is a CPTP decoder with ;
there is a density operator such that
in one, hence every, orthonormal code basis,
for the Kraus family ,
for scalar coefficients .
If these conditions hold and , then
The recovered channel preserves every external reference.
Proof. Suppose , and dilate by an isometry . Then
dilates the identity channel. The Choi matrix of identity has rank one. Every Kraus operator of , whose vectorizations give positive summands of that matrix, is therefore proportional to . Consequently
for a single unit vector . Tracing proves (eq:constantcomplement).
Conversely, diagonalize , with . The isometry has no component in the kernel of . Write
The complementary matrix-unit identities give
Thus contains orthonormal vectors, proving (eq:rankcapacity).
Let project onto their span, and define the isometry by . For any fixed code state ,
is CPTP and satisfies .
Matrix units span , proving the equivalence of conditions 2 and 3. Finally,
so constancy is equivalent to condition 4. Equality of channels remains equality after tensoring with any identity map, proving reference preservation.
Displayed formulas in this passage
Oai290-A@1#eq:constantcomplement · line 354
Oai290-A@1#eq:rankcapacity · line 370
unlabeled · line 360
unlabeled · line 364
unlabeled · line 380
unlabeled · line 388
unlabeled · line 398
unlabeled · line 402
unlabeled · line 411
unlabeled · line 420