Manuscript Hawk01-B@1 · Hawk01-B.tex · theorem · cfa976f1

Theorem: Exact recovery and constant complement

Exact and approximate residual-leakage certificates › Exact arbitrary-code criterion · lines 290–365 · proof included or linked

Hawk01-B@1#thm:exact, Hawk01-B@1#eq:constantcomplement, Hawk01-B@1#eq:KL, Hawk01-B@1#eq:rankcapacity

Back to manuscript

For a finite-dimensional isometry , the following are equivalent:

  1. there is a CPTP map with ;

  2. there is a density operator such that

  3. for a Kraus family of ,

    with scalar coefficients .

If these conditions hold and , then

Proof. Dilate an exact decoder by . The composite dilates the identity channel. The Choi matrix of the identity has rank one, so every Kraus operator of that composite is proportional to . Consequently

for one fixed normalized vector . Tracing proves (eq:constantcomplement).

Conversely, diagonalize , with , and write

The constant-complement identities on the matrix units give

Thus there are orthonormal vectors in , proving (eq:rankcapacity). On their span , define . For a fixed state , the map

is CPTP and satisfies .

Finally, in the environment basis associated with the Kraus family,

Constancy on every operator is equivalent to (eq:KL).

Displayed formulas in this passage

  • Hawk01-B@1#eq:constantcomplement · line 298

  • Hawk01-B@1#eq:KL · line 304

  • Hawk01-B@1#eq:rankcapacity · line 312

  • unlabeled · line 325

  • unlabeled · line 335

  • unlabeled · line 341

  • unlabeled · line 350

  • unlabeled · line 359

Nearby in this section