D. Aharonov, W. Van-dam, J. Kemp, Z. Landau, S. Lloyd et al., Adiabatic quantum computation is equivalent to standard quantum computation, SIAM J. Comput, vol.37, pp.166-180, 2007.

A. Ambainis, M. Beaudry, M. Golovkins, A. Mercer, M. Thérien et al., Algebraic results on quantum automata, Theory Comput. Syst, vol.39, pp.165-188, 2006.

A. Ambainis and A. S. Yakaryilmaz, Automata and quantum computing, 2015.

W. Van-dam, M. Mosca, and U. Vazirani, How powerful is adiabatic quantum computation?, Proc. of FOCS, pp.279-287, 2001.

E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren et al., A quantum evolution algorithm applied to random instances of an NP-complete problem, Science, vol.292, pp.472-476, 2001.

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, 2000.

R. Freivalds, M. Ozols, and L. Man?inska, Improved constructions of mixed state quantum automata, Theoret. Comput. Sci, vol.410, 1923.

J. Gruska, Quantum Computing, 2000.

T. Kato, On the adiabatic theorem of quantum mechanics, J. Phys. Soc. Jap, vol.5, pp.435-439, 1951.

A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation, 2002.

A. Messiah, Quantum Mechanics, 1958.

C. Moore and J. P. Crutchfield, Quantum automata and quantum grammars, Theor. Comp. Sci, vol.237, pp.275-306, 2000.

M. Nakanishi, Quantum pushdown automata with garbage tape, Int. J. Found. Comput. Sci, vol.29, pp.425-446, 2018.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 2000.

A. Yakaryilmaz and A. C. Say, Unbounded-error quantum computation with small space bounds, Inf. Comput, vol.279, pp.873-892, 2011.

T. Yamakami, Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice, LATA 2019, vol.11417, pp.134-145, 2018.