Manuscript IX-B-ST@1 · IX-B-ST.tex · proposition · f6af1523

Proposition: Calibration limits

Finite numerical certificates and a destructive clock › Complete destructive clock · lines 1675–1696 · proof included or linked

IX-B-ST@1#prop:calibration

Back to manuscript

If a fixed readout event has distinct labels satisfying

at most one label has positive probability. Nontrivial multi-outcome programme or history readout therefore does not assert that all labels equal the time of one event.

The clock channel has no universal left inverse on its full input space.

Proof. Distinct labels prove the first assertion. For the second, the two clock states , tensored with the same payload, give identical destructive outputs. A universal left inverse could not recover both.

Displayed formulas in this passage

  • unlabeled · line 1679

Nearby in this section