QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
2008 ◽
Vol 06
(02)
◽
pp. 219-236
◽
Keyword(s):
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.
Keyword(s):
2015 ◽
Vol 23
(6)
◽
pp. 2034-2047
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
2020 ◽
Vol 15
(5)
◽
pp. 620-629
Keyword(s):
2012 ◽
Vol 23
(7)
◽
pp. 1656-1668
◽