Formal verification of communication protocols using quantized Horn clauses

The stochastic nature of quantum communication protocols naturally lends itself for expression via probabilistic logic languages. In this work we describe quantized computation using Horn clauses and base the semantics on quantum probability. Turing computable Horn clauses are very convenient to work with and the formalism can be extended to general form of first order languages. Towards this end we build a Hilbert space of H-interpretations and a corresponding non commutative von Neumann algebra of bounded linear operators. We demonstrate the expressive power of the language by casting quantum communication protocols as Horn clauses.