1. Aaronson, S.: Quantum lower bound for Recursive Fourier Sampling. Quantum Information and Computation 3(2), 165–174 (2003). arXiv:quant-ph/0209060
2. Ambainis, A.: Superlinear advantage for exact quantum algorithms (2012). arXiv:1211.0721
3. Ambainis, A., Iraids, J., Smotrovs, J.: Exact quantum query complexity of EXACT and THRESHOLD (2013). arXiv:1302.1235
4. Barnum, H., Saks, M., Szegedy, M.: Quantum query complexity and semi-definite programming. In: Proceedings of 18th Annual IEEE Conference on Computational Complexity, pp. 179–193 (2003)
5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48(4), 778–797 (2001). arXiv:quant-ph/9802049