scholarly journals ON THE INDEX AND DILATIONS OF COMPLETELY POSITIVE SEMIGROUPS

1999 ◽  
Vol 10 (07) ◽  
pp. 791-823 ◽  
Author(s):  
WILLIAM ARVESON

It is known that every semigroup of normal completely positive maps P = {Pt:t≥ 0} of ℬ(H), satisfying Pt(1) = 1 for every t ≥ 0, has a minimal dilation to an E0 acting on ℬ(K) for some Hilbert space K⊇H. The minimal dilation of P is unique up to conjugacy. In a previous paper a numerical index was introduced for semigroups of completely positive maps and it was shown that the index of P agrees with the index of its minimal dilation to an E0-semigroup. However, no examples were discussed, and no computations were made. In this paper we calculate the index of a unital completely positive semigroup whose generator is a bounded operator [Formula: see text] in terms of natural structures associated with the generator. This includes all unital CP semigroups acting on matrix algebras. We also show that the minimal dilation of the semigroup P={ exp tL:t≥ 0} to an E0-semigroup is is cocycle conjugate to a CAR/CCR flow.

1999 ◽  
Vol 10 (07) ◽  
pp. 773-790 ◽  
Author(s):  
ROBERT T. POWERS

The paper concerns Eo-semigroup of [Formula: see text] induced from unit preserving completely positive semigroups of mapping of an (n × n) matrix algebra into itself. It is shown that Eo-semigroups one obtains are completely spatial and the index of the induced semigroup can be easily computed.


2006 ◽  
Vol 16 (3) ◽  
pp. 429-451 ◽  
Author(s):  
ELLIE D'HONDT ◽  
PRAKASH PANANGADEN

We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming, we develop a notion that is directly taken from concepts used in quantum computation. The proof that weakest preconditions exist for completely positive maps follows immediately from the Kraus representation theorem. As an example, we give the semantics of Selinger's language in terms of our weakest preconditions. We also cover some specific situations and exhibit an interesting link with stabilisers.


Sign in / Sign up

Export Citation Format

Share Document