QUANTUM HITTING TIME ON THE COMPLETE GRAPH
暂无分享,去创建一个
[1] Todd A. Brun,et al. Quantum walks with infinite hitting times , 2006 .
[2] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[3] Andrew M. Childs,et al. Spatial search by quantum walk , 2003, quant-ph/0306054.
[4] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[5] K. Birgitta Whaley,et al. Quantum random-walk search algorithm , 2002, quant-ph/0210064.
[6] Renato Portugal,et al. Group velocity of discrete-time quantum walks , 2009, 0901.4237.
[7] Avatar Tulsi,et al. Faster quantum-walk algorithm for the two-dimensional spatial search , 2008, 0801.0497.
[8] Frédéric Magniez,et al. On the Hitting Times of Quantum Versus Random Walks , 2008, Algorithmica.
[9] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[10] E. Farhi,et al. Quantum computation and decision trees , 1997, quant-ph/9706062.
[11] Todd A. Brun,et al. Hitting time for the continuous quantum walk , 2008, 0803.3446.
[12] D. Owen. Handbook of Mathematical Functions with Formulas , 1965 .
[13] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[14] Aharonov,et al. Quantum random walks. , 1993, Physical review. A, Atomic, molecular, and optical physics.
[15] M. Szegedy,et al. Quantum Walk Based Search Algorithms , 2008, TAMC.
[16] Julia Kempe,et al. Discrete Quantum Walks Hit Exponentially Faster , 2005 .