Quantum Walks for Computer Scientists

作者: Salvador Elias Venegas-Andraca

DOI:

关键词:

摘要: Quantum computation, one of the latest joint ventures between physics and theory is a scientific field whose main goals include development hardware algorithms based on quantum mechanical properties those physical systems used to implement such algorithms.Solving difficult tasks (for example, Satisfiability Problem other NP-complete problems) requires sophisticated algorithms, many ofwhich employ stochastic processes as their mathematical basis.Discrete random walks are popular choice among processes.Inspired success discrete in algorithm development, walks, an emerging generalization into world.The purpose this lecture provide concise yet comprehensive introduction walks.Table Contents: Introduction / Mechanics Theory Computation Classical Random Walks Computer Science Conclusions

参考文章(193)
Hari Krovi, Todd A. Brun, Symmetry in quantum walks PhDT. ,(2007)
Scott Aaronson, Andris Ambainis, Quantum Search of Spatial Regions Theory of Computing. ,vol. 1, pp. 47- 79 ,(2005) , 10.4086/TOC.2005.V001A004
Kazuo Iwama, Suguru Tamaki, Improved Upper Bounds for 3-SAT Electronic Colloquium on Computational Complexity. ,(2003)
Sándor Imre, Ferenc Balázs, Quantum Computing and Communications: An Engineering Approach John Wiley & Sons Ltd,.. ,(2005) , 10.1002/9780470869048
Salvador Elías Venegas-Andraca, Discrete quantum walks and quantum image processing University of Oxford. ,(2005)
Salvador Godoy, Shigeji Fujita, A quantum random-walk model for tunneling diffusion in a 1D lattice. A quantum correction to Fick's law Journal of Chemical Physics. ,vol. 97, pp. 5148- 5154 ,(1992) , 10.1063/1.463812
D.M. Hutton, The Essential Turing Kybernetes. ,vol. 36, pp. 550- 551 ,(2007) , 10.1108/03684920710747147
Julian Russell Brown, The Quest for the Quantum Computer ,(2000)