Manuscript Hawk02-C@2 · Hawk02-C.tex · theorem · bb332d66

Theorem: Implemented recovery and complete residual

Implementation assembly and a finite epsilon regime › Interfaces and complete preparation · lines 1752–1822 · proof included or linked

Hawk02-C@2#thm:C8, Hawk02-C@2#eq:main, Hawk02-C@2#eq:actualleak

Back to manuscript

Under the declared comparisons,

For the complete predecoder residual,

A separate accessible collection allowance adds to recovery. It bounds a chosen complete postcollection residual only when an appropriate complete collection comparison is also supplied.

For the semicircle model, a sufficient analytical bound is

Proof. First replace actual preparation by ideal preparation while using the same actual full propagator. Contractivity costs at most . The remaining comparison starts in the checked ideal sector and costs at most by Theorem thm:C6. Thus the complete emitted channels differ by at most .

Partial trace gives the same accessible allowance. Replacing the decoder adds at most . Add the exact ideal recovery error of Theorem thm:C4.

For the residual, take the other partial trace and compare with (eq:residualtau). All preparation outputs are retained, so this is a complete comparison, not an accessible-only preparation estimate.

A separate collector adds its channel allowance by contractivity. Such a distance does not compare a preselected environmental dilation; that requires its own complete comparison KSW.

Finally use Theorem thm:C5 and Lemma lem:packetbound.

Displayed formulas in this passage

  • Hawk02-C@2#eq:main · line 1755

  • Hawk02-C@2#eq:actualleak · line 1766

  • unlabeled · line 1785

Nearby in this section