QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS

DOI10.1142/S0219749908003530zbMath1151.81305WikidataQ59196679 ScholiaQ59196679MaRDI QIDQ3534212

Pedro Baltazar, Paulo Mateus, Rohit Chadha

Publication date: 3 November 2008

Published in: International Journal of Quantum Information (Search for Journal in Brave)

zbMATH Keywords

completenessquantum logicverifying quantum systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (7)

Model-Checking Linear-Time Properties of Quantum Systems ⋮ Model checking quantum Markov chains ⋮ Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect ⋮ Probabilization of logics: completeness and decidability ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ Quantum protocols for zero-knowledge systems ⋮ Model Checking for Verification of Quantum Circuits

Cites Work

• A logic for reasoning about probabilities
• Weakly complete axiomatization of exogenous quantum propositional logic
• LQP: the dynamic logic of quantum information

This page was built for publication: QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS