BenoƮt Valiron (Philadelphia, US), On denotational semantics of quantum computation


  • Feb. 24, 2012, 10:40 - 11:20


(joint work with Michele Pagani and Peter Selinger)

If denotational semantics of strictly linear quantum computation is relatively well understood using the category CPM of completely positive maps, the relation between duplicable and non-duplicable data is yet to be analyzed. In this talk I will present an approach for understanding duplicable objects in quantum computation. The technique I will present extends the well-known category CPM using the general constructions of the exponential "!" that can be used in relational models of linear logic.