1. Deutsch, D., Jozsa, R.: Rapid solutions of problems by quantum computation. Proc. R. Soc. Lond. A 439, 553–558 (1992)
2. Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. pp. 124–134 (1994)
3. Denchev, V., Boixo, S., Isakov, S., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., Neven, H.: What is the computational value of finite range tunneling.
arXiv:1512.02206
[quant-ph]
4. Crosson, E., Harrow, A.: Simulated quantum annealing can be exponentially faster than classical simulated annealing.
arXiv:1601.03030
[quant-ph]
5. Farhi, E., Goldston, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. MIT-CTP-2936 (2000)