Efficient probability amplification in two-way quantum finite automata
From MaRDI portal
Publication:1017406
DOI10.1016/j.tcs.2009.01.029zbMath1163.68026OpenAlexW1963986274MaRDI QIDQ1017406
Abuzer Yakaryılmaz, A. C. Cem Say
Publication date: 19 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.029
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items
Quantum Pushdown Automata with Garbage Tape ⋮ SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES ⋮ Quantum computation with write-only memory ⋮ Unbounded-error quantum computation with small space bounds ⋮ New Results on the Minimum Amount of Useful Space ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata
Cites Work