Languages Recognized with Unbounded Error by Quantum Finite Automata

被引：0
|
作者：
Yakaryilmaz, Abuzer [1 ]
Say, A. C. Cem [1 ]
机构：
[1] Bogazici Univ, Dept Comp Engn, TR-34342 Istanbul, Turkey
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2009年 / 5675卷
关键词：
COMPLEXITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even "1.5-way") movement, more languages become recognizable. This leads to the conclusion that, quantum Turing machines are more powerful than probabilistic Turing, machines when restricted to constant space bounds.
引用
收藏
页码：356 / 367
页数：12
相关论文
共 50 条
  • [1] LANGUAGES RECOGNIZED BY NONDETERMINISTIC QUANTUM FINITE AUTOMATA
    Yakaryilmaz, Abuzer
    Say, A. C. Cem
    QUANTUM INFORMATION & COMPUTATION, 2010, 10 (9-10) : 747 - 770
  • [2] Languages recognized by nondeterministic quantum finite automata
    Yakaryilmaz, Abuzer
    Cem Say, A.C.
    Quantum Information and Computation, 2010, 10 (9-10): : 747 - 770
  • [3] Languages recognized by a class of finite automata
    Kelarev, A.V.
    Sokratova, O.V.
    Acta Cybernetica, 2001, 15 (01): : 45 - 52
  • [4] SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES
    Zheng, Shenggen
    Qiu, Daowen
    Li, Lvzhou
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 1117 - 1129
  • [5] Languages recognizable by quantum finite automata
    Freivalds, R
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 1 - 14
  • [6] Quantum Automata and Languages of Finite Index
    Benso, Andrea
    D'Alessandro, Flavio
    Papi, Paolo
    REACHABILITY PROBLEMS, RP 2024, 2024, 15050 : 88 - 103
  • [7] Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata
    Comin, Carlo
    FUNDAMENTA INFORMATICAE, 2014, 134 (3-4) : 335 - 353
  • [8] Latvian Quantum Finite State Automata for Unary Languages
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [9] Latvian Quantum Finite State Automata for Unary Languages
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 388 : 63 - 78
  • [10] Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
    Golovkins, Marats
    Kravtsev, Maksim
    Kravcevs, Vasilijs
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 351 - 363
12345