Manuscript X-K-ST@1 · X-K-ST.tex · theorem · 93c39c0f

Theorem: Two-clock complete output

An explicit two-readout, two-route certificate › Complete formula · lines 1522–1585 · proof included or linked

X-K-ST@1#thm:twoclock, X-K-ST@1#eq:twoclock

Back to manuscript

On the specified input and output boundary, the complete channel is

It is CPTP on every input operator and every reference extension. Both clock inputs are consumed.

For the particular supplied clocks

and arbitrary payload–reference state , the nonzero public probabilities are

The corresponding payload–reference blocks are

The failure probability is , and the failure output is retained.

Proof. For each fixed , summing over gives

while . Hence

The routes return the other payload slot in the independent blank by Theorem thm:route. Copying the already classical gives the displayed record duplication. This proves (eq:twoclock), including the reference version.

The first clock gives with probability . If , the second clock remains . If , it becomes , giving equally. Substitute the controlled payload gates.

Displayed formulas in this passage

  • X-K-ST@1#eq:twoclock · line 1526

  • unlabeled · line 1538

  • unlabeled · line 1544

  • unlabeled · line 1551

  • unlabeled · line 1563

  • unlabeled · line 1569

Nearby in this section