Zapata Fonseca, Octavio Baltasar; (2019) Logical Aspects of Probability and Quantum Computation. Doctoral thesis (Ph.D), UCL (University College London).

Preview

Text thesis.pdf Download (354kB) | Preview

Abstract

Most of the work presented in this document can be read as a sequel to previous work of the author and collaborators, which has been published and appears in [DSZ16, DSZ17, ABdSZ17]. In [ABdSZ17], the mathematical description of quantum homomorphisms of graphs and more generally of relational structures, using the language of category theory is given. In particular, we introduced the concept of ‘quantum’ monad. In this thesis we show that the quantum monad fits nicely into the categorical framework of effectus theory, developed by Jacobs et al. [Jac15, CJWW15]. Effectus theory is an emergent field in categorical logic aiming to describe logic and probability, from the point of view of classical and quantum computation. The main contribution in the first part of this document prove that the Kleisli category of the quantum monad on relational structures is an effectus. The second part is rather different. There, distinct facets of the equivalence relation on graphs called cospectrality are described: algebraic, combinatorial and logical relations are presented as sufficient conditions on graphs for having the same spectrum (i.e. being ‘cospectral’). Other equivalence of graphs (called fractional isomorphism) is also related using some ‘game’ comonads from Abramsky et al. [ADW17, Sha17, AS18]. We also describe a sufficient condition for a pair of graphs to be cospectral using the quantum monad: two Kleisli morphisms (going in opposite directions) between them satisfying certain compatibility requirement.

Download activity - last month

Export as XMLCSVJSON

Download activity - last 12 months

Export as CSVXMLJSON

Downloads by country - last 12 months

Export as CSVXMLJSON

Archive Staff Only

View Item