A complete pointer instrument

Destructive verification uses different trials from coherent message return.

After finite access and, when desired, the decoder, choose a bounded basis rotation on the retained finite register. Computational measurement has selective maps

An ordinary raw record is $y_j$. The record alphabet is enlarged by access failures, reset failures, assignment failures, and any other declared visible status. Each failure has a fixed bounded score; no failed trial is deleted.

A fresh pointer block is copied by controlled-NOT gates, read computationally, and consumed together with the tested register. A correlated stochastic assignment matrix $W(y\mid j)$ gives

It is a complete channel on arbitrary tested states.