Manuscript En07-A@1 · En07-A.tex · theorem · 44229ce9

Theorem: Exact recovery criterion, locally restated

Complete channels, access, and local recovery facts › Exact accessible recovery and the complete complement · lines 473–561 · proof included or linked

En07-A@1#thm:exact, En07-A@1#eq:normalform, En07-A@1#eq:decoder

Back to manuscript

For an isometry , the following are equivalent:

  1. there is a CPTP map with ;

  2. for some state ;

  3. for every matrix unit;

When these conditions hold, there are a separable Hilbert space , a state , and an isometry such that

An exact decoder is

Proof. Linearity gives equivalence of (ii) and (iii). Expanding the Bell projector gives equivalence of (iii) and (iv).

Assume (ii), and write the nonzero spectral decomposition

The index set is finite or countable. The constancy condition puts every in . Write

The complementary matrix-unit identities imply

Consequently

extends to an isometry. With , tracing gives (eq:normalform).

Both terms of (eq:decoder) are completely positive, and their traces sum to . Substitution into (eq:normalform) gives exact recovery of every matrix unit.

Conversely, dilate an exact decoder by a Stinespring isometry . The normal channel dilation is the standard mathematical structure theorem Stinespring,Watrous. Put . Since the decoded marginal for basis input is pure,

Exact recovery of forces . All the normalized vectors therefore coincide. Tracing the decoded register and gives

which is (iii).

Displayed formulas in this passage

  • En07-A@1#eq:normalform · line 490

  • En07-A@1#eq:decoder · line 495

  • unlabeled · line 483

  • unlabeled · line 510

  • unlabeled · line 518

  • unlabeled · line 525

  • unlabeled · line 530

  • unlabeled · line 549

  • unlabeled · line 556

Nearby in this section