Quantum computation tree logic - Model checking and complete calculus
Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper, we consider quantum computation tree logic ( QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL model- checking algorithm with the dEQPL model- checking algorithm to obtain a model- checking algorithm for QCTL. Finally, we illustrate the use of the logic by reasoning about the BB84 key distribution protocol.
completeness quantum logic verifying quantum systems