Universal mixing of quantum walk on graphs

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribution. Our results include the following: • All weighted complete multipartite graphs are instantaneous universal mixing. This is in contrast to the fact that no unweighted complete multipartite graphs are uniform mixing (except for the four-cycle K2,2). • For all n ≥ 1, the weighted claw K1,n is a minimally connected instantaneous universal mixing graph. In fact, as a corollary, the unweighted K1,n is instantaneous uniform mixing. This adds a new family of uniform mixing graphs to a list that so far contains only the hypercubes. • Any weighted graph is average almost-uniform mixing unless its spectral type is sublinear in the size of the graph. This provides a nearly tight characterization for average uniform mixing on circulant graphs. • No weighted graphs are average universal mixing. This shows that weights do not help to achieve average universal mixing, unlike the instantaneous case. Our proofs exploit the spectra of the underlying weighted graphs and path collapsing arguments.

[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..