On the maximalC *-algebra of zeros of completely positive mapping and on the boundary of a dynamic semigroup

1994 ◽  
Vol 56 (6) ◽  
pp. 1271-1282 ◽  
Author(s):  
A. M. Chebotarev

2013 ◽  
Vol 34 (2) ◽  
pp. 355-368 ◽  
Author(s):  
Naomi Shaked-Monderer ◽  
Immanuel M. Bomze ◽  
Florian Jarre ◽  
Werner Schachinger


1994 ◽  
Vol 06 (05a) ◽  
pp. 1147-1161 ◽  
Author(s):  
MARY BETH RUSKAI

New bounds are given on the contraction of certain generalized forms of the relative entropy of two positive semi-definite operators under completely positive mappings. In addition, several conjectures are presented, one of which would give a strengthening of strong subadditivity. As an application of these bounds in the classical discrete case, a new proof of 2-point logarithmic Sobolev inequalities is presented in an Appendix.



1972 ◽  
Vol 24 (3) ◽  
pp. 520-529 ◽  
Author(s):  
Man-Duen Choi

The objective of this paper is to give some concrete distinctions between positive linear maps and completely positive linear maps on C*-algebras of operators.Herein, C*-algebras possess an identity and are written in German type . Capital letters A, B, C stand for operators, script letters for vector spaces, small letters x, y, z for vectors. Capital Greek letters Φ, Ψ stand for linear maps on C*-algebras, small Greek letters α, β, γ for complex numbers.We denote by the collection of all n × n complex matrices. () = ⊗ is the C*-algebra of n × n matrices over .



2003 ◽  
Vol 68 (1) ◽  
Author(s):  
Robert Alicki ◽  
Stanisław Kryszewski


2016 ◽  
Vol 4 (1) ◽  
Author(s):  
G. Dahl ◽  
T. A. Haufmann

AbstractA matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept and show connections between the two notions. An important relation to the so-called cut cone is established. Some results are shown for f0, 1g-completely positive matrices with given graphs, and for {0,1}-completely positive matrices constructed from the classes of (0, 1)-matrices with fixed row and column sums.



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