1. A. Ambainis, R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalizations, in: FOCSʼ98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 332–341.
2. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, in: FOCSʼ98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 352–361.
3. Quantum complexity theory;Bernstein;SIAM Journal on Computing,1997
4. Quantum computing: 1-way quantum automata;Bertoni,2003
5. G. Brassard, P. Hoyer, An exact quantum polynomial-time algorithm for Simonʼs problem, in: ISTCSʼ97: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems, 1997, pp. 12–23.