An overview of quantum computation models: Quantum automata

作者：Qiu Daowen^*; Li Lvzhou

来源：Frontiers of Computer Science in China, 2008, 2(2): 193-207.

DOI：10.1007/s11704-008-0022-y

• (e ,2e) theory
• (semi)automata
• Higher education (HE)
• Orthomodular lattices
• pushdown automaton
• Quantum automata
• Quantum cellular automata (QCA)
• quantum computations
• Quantum finite automaton (QFA)
• Quantum logic
• quantum Turing machines
• Springer (CO)

Quantum automata, as theoretical models of quantum computers, include quantum finite automata (QFA), quantum sequential machines (QSM), quantum pushdown automata (QPDA), quantum Turing machines (QTM), quantum cellular automata (QCA), and the others, for example, automata theory based on quantum logic (orthomodular lattice-valued automata). In this paper, we try to outline a basic progress in the research on these models, focusing on QFA, QSM, QPDA, QTM, and orthomodular lattice-valued automata. Also, other models closely relative to them are mentioned. In particular, based on the existing results in the literature, we finally address a number of problems to be studied in future. ? 2008 Higher Education Press and Springer-Verlag.

• 出版日期2008
• 单位中山大学