Mixing in Continuous Quantum Walks on Graphs
| dc.creator | Ahmadi, Amir | |
| dc.creator | Belk, Ryan | |
| dc.creator | Tamon, Christino | |
| dc.creator | Wendler, Carolyn | |
| dc.date | 2002-09-18 | |
| dc.date | 2003-04-16 | |
| dc.date.accessioned | 2026-07-07T06:04:58Z | |
| dc.date.available | 2026-07-07T06:04:58Z | |
| dc.description | Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs lack this mixing property as well. | |
| dc.description | 8 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0209106 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0209106 | |
| dc.identifier | Quantum Information and Computation 3 (2003), 611-618. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90500 | |
| dc.subject | Quantum Physics | |
| dc.title | Mixing in Continuous Quantum Walks on Graphs | |
| dc.type | text |