Fibred Coalgebraic Logic and Quantum Protocols

  title={Fibred Coalgebraic Logic and Quantum Protocols},
  author={Dan Marsden},
  • Dan Marsden
  • Published in QPL 27 December 2014
  • Computer Science
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions on different fibres. As this fibred setting will typically involve multiple signature functors, the logic incorporates a calculus of modalities enabling the construction of new modalities using various composition operations. We extend the semantics of… 

Logical aspects of quantum computation

This thesis begins by demonstrating the effectiveness of string diagrams for practical calculations in category theory, and introduces a parameterized, duality based frame- work for coalgebraic logic, and proves that the semantics of these logics satisfy certain "institution conditions" providing harmony between syntactic and semantic transformations.



Expressivity of coalgebraic modal logic: The limits and beyond

Coalgebras, Chu Spaces, and Representations of Physical Systems

  • S. Abramsky
  • Mathematics
    2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
This work introduces a fibrational structure on coalgebras in which contravariance is represented by indexing, and defines equality in this semantics as projective equivalence, to give a universal semantics for quantum systems based on a final coalgebra construction.

Coalgebras with Symmetries and Modelling Quantum Systems

A generalization of the usual category in which coalgebras are considered, and its application to modelling quantum systems and their physical symmetries using coalgebraic techniques is described.

Translating Logics for Coalgebras

It is shown, that three different types of logics for coalgebras are institutions, each with a syntax-free representation of behavioural properties, and the syntax of which is given as an initial algebra.

Institutions: abstract model theory for specification and programming

This paper says that any institution such that signatures can be glued together, also allows gluing together theories (which are just collections of sentences over a fixed signature), and shows how to define institutions that allow sentences and constraints from two or more institutions.

Probability Logic for Type Spaces

Type spaces in the sense of Harsanyi (1967/68) can be considered as the probabilistic analog of Kripke structures. By an infinitary propositional language with additional operators “individual i

Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.

An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen