Manuscript Hawk04-B@2 · Hawk04-B.tex · theorem · ba3b0713
Theorem: Readout-and-drop is exactly local partial trace
Residual readout, local forgetting, and the apparatus › The explicitly added residual programs · lines 1029–1065 · proof included or linked
Hawk04-B@2#thm:drop, Hawk04-B@2#eq:forget-equality
For every joint state, including any external reference,
Consequently,
Its radiation-only recovery error is exactly the pre-existing .
More generally, every trace-preserving operation on , with all its outputs ignored, leaves the state on the untouched reference and unchanged.
Proof. Partial trace in the computational basis is the sum of the diagonal -blocks, which proves the first equality and (eq:forget-equality).
For the general statement, let be the local channel. Its Heisenberg adjoint is unital. For every bounded observable on the untouched factors,
All expectations on those factors are unchanged. This argument applies to normal channels on separable spaces; equivalently, in a Kraus representation, .
Displayed formulas in this passage
Hawk04-B@2#eq:forget-equality · line 1038
unlabeled · line 1032
unlabeled · line 1058