A small 1-way quantum finite automaton
量子物理
2007-05-23 v1
摘要
We study 1-way quantum finite automata (QFAs) and compare them with their classical counterparts. We show that 1-way QFAs can be very space efficient. We construct a 1-way QFAs that are quadratically smaller than any equivalent deterministic finite automata and give the correct answer with a large probability by recognizing the languages in a two letter alphabet "the number of the letters a and the number of the letters b are divisible by n".
引用
@article{arxiv.quant-ph/9810065,
title = {A small 1-way quantum finite automaton},
author = {Arnolds Kikusts},
journal= {arXiv preprint arXiv:quant-ph/9810065},
year = {2007}
}
备注
7 pages, LATEX, uses article.sty