26 May 2016 Formal verification of communication protocols using quantized Horn clauses
Author Affiliations +
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.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Radhakrishnan Balu, Radhakrishnan Balu, } "Formal verification of communication protocols using quantized Horn clauses", Proc. SPIE 9873, Quantum Information and Computation IX, 98730F (26 May 2016); doi: 10.1117/12.2222590; https://doi.org/10.1117/12.2222590
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

How often must we apply syndrome measurements?
Proceedings of SPIE (May 20 2015)
A geometric view of quantum cellular automata
Proceedings of SPIE (May 08 2012)
Symmetry and concatenated quantum codes
Proceedings of SPIE (May 24 2005)
Hawk-Dove-Bully-Retaliator quantum game CAS aided
Proceedings of SPIE (April 16 2010)

Back to Top