首页 | 本学科首页   官方微博 | 高级检索  
     


An overview of quantum computation models: quantumautomata
Authors:QIU Daowen  LI Lvzhou
Affiliation:Department of Computer Science, Sun Yat-Sen University;
Abstract: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.
Keywords:
点击此处可从《Frontiers of Computer Science》浏览原始摘要信息
点击此处可从《Frontiers of Computer Science》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号