Share Email Print

Proceedings Paper

Formal verification of communication protocols using quantized Horn clauses
Author(s): Radhakrishnan Balu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 26 May 2016
PDF: 15 pages
Proc. SPIE 9873, Quantum Information and Computation IX, 98730F (26 May 2016); doi: 10.1117/12.2222590
Show Author Affiliations
Radhakrishnan Balu, U.S. Army Research Lab. (United States)

Published in SPIE Proceedings Vol. 9873:
Quantum Information and Computation IX
Eric Donkor; Michael Hayduk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?