Manuscript Oai280-B@1 · Oai280-B.tex · theorem · 6d92ab75
Theorem: Exact complete-complement criterion
Privacy, perfectness, and exact access-dependent recovery › The complete-complement criterion · lines 489–543 · proof included or linked
Oai280-B@1#thm:exact
Let be a finite-dimensional isometry and let be its two reductions. The following are equivalent:
a CPTP decoder satisfies ;
for one state ;
for every matrix unit.
If , then . The recovered channel preserves every independent external reference.
Proof. The equivalence of the last two statements is linearity. For the forward direction, dilate the decoder by an isometry . Then
dilates the identity. Purity of its decoded marginal on a basis input gives . Recovery of gives . All normalized coincide. Tracing proves constancy of the complement.
Conversely, diagonalize , with . Write
The complementary matrix-unit identities give
Thus vectors in are orthonormal. Define the isometry by , and let . Then
For any fixed state on ,
is CP and trace preserving on all of , and recovers every matrix unit. Equality of channels remains equality after reference amplification.
Displayed formulas in this passage
unlabeled · line 509
unlabeled · line 521
unlabeled · line 525
unlabeled · line 532
unlabeled · line 536