Linear temporal logic is a widely used method for verification of model checking and expressing the system specifications. The relationship between theory of automata and logic had a great influence in the computer science. Investigation of the relationship between quantum finite automata and linear temporal logic is a natural goal. In this paper, we present a construction of quantum finite automata on finite words from linear-time temporal logic formulas. Further, the relation between quantum finite automata and linear temporal logic is explored in terms of language recognition and acceptance probability. We have shown that the class of languages accepted by quantum finite automata are definable in linear temporal logic, except for measure-once one-way quantum finite automata.

中文翻译：

---

线性时序逻辑与量子有限自动机的关系

线性时序逻辑是一种广泛用于验证模型检查和表达系统规范的方法。自动机理论与逻辑的关系在计算机科学中产生了很大的影响。研究量子有限自动机和线性时序逻辑之间的关系是一个自然的目标。在本文中，我们提出了一种基于线性时间时序逻辑公式的有限词的量子有限自动机的构造。此外，在语言识别和接受概率方面探索了量子有限自动机和线性时间逻辑之间的关系。我们已经证明，除了测量一次的单向量子有限自动机之外，量子有限自动机接受的语言类别在线性时间逻辑中是可定义的。