Complete-output bounds for general finite programs

The contraction argument is standard finite-channel analysis, proved here on the needed Hermitian differences Watrous. It also bounds preparation errors for an installed approximate value $\tilde{a}$:

This does not imply that distinct deterministic orthogonal numerical report words are close as channels.