Formal verification of communication protocols using quantized Horn clauses

Radhakrishnan Balu

doi:10.1117/12.2222590

26 May 2016 Formal verification of communication protocols using quantized Horn clauses

Radhakrishnan Balu

Proceedings Volume 9873, Quantum Information and Computation IX; 98730F (2016) https://doi.org/10.1117/12.2222590
Event: SPIE Commercial + Scientific Sensing and Imaging, 2016, Baltimore, MD, United States

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.

Citation Download Citation

Radhakrishnan Balu "Formal verification of communication protocols using quantized Horn clauses", Proc. SPIE 9873, Quantum Information and Computation IX, 98730F (26 May 2016); https://doi.org/10.1117/12.2222590

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available