Universal mixing of quantum walk on graphs
暂无分享,去创建一个
Christino Tamon | Julian Rosen | William Carlson | Allison For | Elizabeth Harris | Kathleen Wrobel | Julian Rosen | C. Tamon | William Carlson | A. For | Elizabeth Harris | K. Wrobel
[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[2] Stephen P. Boyd,et al. Fastest Mixing Markov Chain on a Path , 2006, Am. Math. Mon..
[3] Christino Tamon,et al. Mixing of quantum walk on circulant bunkbeds , 2006, Quantum Inf. Comput..
[4] Viv Kendon,et al. Decoherence in Discrete Quantum Walks , 2004 .
[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[6] A. Russell,et al. Decoherence in quantum walks on the hypercube , 2005, quant-ph/0501169.
[7] Daniel A. Spielman,et al. Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.
[8] Charles R. Johnson,et al. Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree , 2008 .
[9] L. Lovász. Combinatorial problems and exercises , 1979 .
[10] John Watrous,et al. Continuous-Time Quantum Walks on the Symmetric Group , 2003, RANDOM-APPROX.
[11] Viv Kendon,et al. Decoherence can be useful in quantum walks , 2002, quant-ph/0209005.
[12] Viv Kendon,et al. Quantum walks on general graphs , 2003, quant-ph/0306140.
[13] Alexander Russell,et al. Quantum Walks on the Hypercube , 2002, RANDOM.
[14] Christino Tamon,et al. Mixing and decoherence in continuous-time quantum walks on cycles , 2006, Quantum Inf. Comput..
[15] Stephen P. Boyd,et al. Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..
[16] Julia Kempe,et al. Quantum random walks: An introductory overview , 2003, quant-ph/0303081.
[17] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .
[18] E. Farhi,et al. Quantum computation and decision trees , 1997, quant-ph/9706062.
[19] R. Leighton,et al. Feynman Lectures on Physics , 1971 .
[20] Vivien M. Kendon,et al. Decoherence in quantum walks – a review , 2006, Mathematical Structures in Computer Science.
[21] W. Dur,et al. Quantum walks in optical lattices , 2002, quant-ph/0207137.
[22] Charles R. Johnson,et al. The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree , 1999 .
[23] Guy Kindler,et al. On distributions computable by random walks on graphs , 2004, SODA '04.
[24] Andris Ambainis,et al. Quantum walks on graphs , 2000, STOC '01.
[25] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[26] Stephen P. Boyd,et al. The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem , 2006, SIAM Rev..
[27] Christino Tamon,et al. On mixing in continuous-time quantum walks on some circulant graphs , 2003, Quantum Inf. Comput..