1. Ambainis, A., Balodis, K., Iraids, J., Khadiev, K., Kļevickis, V., Prūsis, K., Shen, Y., Smotrovs, J., Vihrovs, J.: Quantum lower and upper bounds for 2D-grid and Dyck language. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 170, pp. 8–1814 (2020)
2. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997). https://doi.org/10.1137/s0097539795293172
3. Cirac, J.I., Zoller, P.: Goals and opportunities in quantum simulation. Nat. Phys. 8(4), 264–266 (2012). https://doi.org/10.1038/nphys2275
4. Georgescu, I.M., Ashhab, S., Nori, F.: Quantum simulation. Rev. Mod. Phys. 86, 153–185 (2014). https://doi.org/10.1103/RevModPhys.86.153
5. Ambainis, A.: Understanding quantum algorithms via query complexity. In: Proceedings of the International Congress of Mathematicians, vol. 4, pp. 3283–3304 (2018)