Manuscript Psy04-B@1 · Psy04-B-v1.tex · section · 62c2b6f0

The concrete finite semantics

Sequential qubit routing and explicit Enter operations › The concrete finite semantics · lines 935–972

Back to manuscript

We use the relevant types

A quantum name is an access right to one factor of a global state. Allocation supplies . A gate consumes and returns its named quantum arguments. Destructive readout consumes the measured name and returns a classical bit.

For a computational-basis readout of ,

and the explicitly specified transition has probability

and normalized residual on positive branches. This is the concrete semantics considered in CheungEnter,CheungI.

A conditional has the same quantum context in its two alternatives but executes only one alternative. Thus it does not duplicate quantum ownership. Classical deletion is represented by

There is no corresponding silent deletion of a quantum name.

Displayed formulas in this passage

  • unlabeled · line 938

  • unlabeled · line 950

  • unlabeled · line 954

  • unlabeled · line 967

Nearby in this section