Author:
Say A.C. Cem,Yakaryılmaz Abuzer
Publisher
Springer International Publishing
Reference29 articles.
1. Adleman, L.M., DeMarrais, J., Huang, M.-D.A.: Quantum computability. SIAM Journal on Computing 26(5), 1524–1540 (1997)
2. Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoretical Computer Science 287(1), 299–311 (2002)
3. Ambainis, A., Beaudry, M., Golovkins, M., Ķikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. Theory of Computing Systems 39(1), 165–188 (2006)
4. A. Ambainis, Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS 1998, pp. 332–341 (1998).
http://arxiv.org/abs/quant-ph/9802062
5. Ambainis, A., Nahimovs, N.: Improved constructions of quantum automata. Theoretical Computer Science 410(20), 1916–1922 (2009)
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献