首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem
  • 本地全文:下载
  • 作者:Zachary Remscrim
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2020
  • 卷号:168
  • 页码:139:1-139:18
  • DOI:10.4230/LIPIcs.ICALP.2020.139
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA, with a single qubit, can recognize, with bounded error, the language L_{eq} = {a^m b^m :m â^^ â".} in expected polynomial time and the language L_{pal} = {w â^^ {a,b}^*:w is a palindrome} in expected exponential time. We further demonstrate the power of 2QCFA by showing that they can recognize the word problems of many groups. In particular 2QCFA, with a single qubit and algebraic number transition amplitudes, can recognize, with bounded error, the word problem of any finitely generated virtually abelian group in expected polynomial time, as well as the word problems of a large class of linear groups in expected exponential time. This latter class (properly) includes all groups with context-free word problem. We also exhibit results for 2QCFA with any constant number of qubits. As a corollary, we obtain a direct improvement on the original Ambainis and Watrous result by showing that L_{eq} can be recognized by a 2QCFA with better parameters. As a further corollary, we show that 2QCFA can recognize certain non-context-free languages in expected polynomial time. In a companion paper, we prove matching lower bounds, thereby showing that the class of languages recognizable with bounded error by a 2QCFA in expected subexponential time is properly contained in the class of languages recognizable with bounded error by a 2QCFA in expected exponential time.
  • 关键词:finite automata; quantum; word problem of a group
国家哲学社会科学文献中心版权所有