Author:
Ide Yusuke,Narimatsu Akihiro
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the $$33$$rd Annual ACM Symposium on Theory of Computing, pp. 37–49 (2001)
2. Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the $$16$$th ACM-SIAM Symposium on Discrete Algorithms, pp. 1099–1108 (2005)
3. Chakraborty, S., Novo, L., Ambainis, A., Omar, Y.: Spatial search by quantum walk is optimal for almost all graphs. Phys. Rev. Lett. 116, 100501 (2016)
4. Childs, A.M.: Universal computation by quantumwalk. Phys. Rev. Lett. 102, 180501 (2009)
5. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by quantum walk. In: Proceedings of the $$35$$rd Annual ACM Symposium on Theory of Computing, pp. 59–68 (2003)