Manuscript Hawk03-A@1 · Hawk03-A.tex · theorem · 9a109c12

Theorem: Complete channels of the benchmark

One explicit unitary finite benchmark › Specified microscopic finite evolution · lines 878–920 · proof included or linked

Hawk03-A@1#thm:modelchannels, Hawk03-A@1#eq:modelN, Hawk03-A@1#eq:modelNc, Hawk03-A@1#eq:modelNE, Hawk03-A@1#eq:modeldecoder

Back to manuscript

The map is an isometry. Let . The complete accessible channel, its complement, and the restriction are

The decoder

followed by the fixed relabeling , satisfies . Thus recovery from alone is exact, with every reference. The complete complement of the channel is also replacement:

Proof. Since is unitary and and are normalized, . Taking the specified partial traces proves (eq:modelN)–(eq:modelNE) on every matrix unit, including off-diagonal units. Applying (eq:modeldecoder) gives . For the complement, trace ; the unitary acts only on the traced output and disappears. The remaining state is the displayed fixed state times . Every equality is a channel identity, hence is reference stable.

Displayed formulas in this passage

  • Hawk03-A@1#eq:modelN · line 883

  • Hawk03-A@1#eq:modelNc · line 883

  • Hawk03-A@1#eq:modelNE · line 883

  • Hawk03-A@1#eq:modeldecoder · line 895

  • unlabeled · line 904

Nearby in this section