1. Lecture Notes in Computer Science;FM Ablayev,1986
2. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64(4), 750–767 (2002)
3. Ambainis, A.: Polynomial degree vs. quantum query complexity. In: Proceedings of FOCS 1998, pp. 230–240 (1998)
4. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of FOCS 1998, pp. 332– 341. Also
quant-ph/9802062
5. Lecture Notes in Computer Science;A Ambainis,2000