On mixing in continuous-time quantum walks on some circulant graphs

Quantum Information and Computation

Volumn 3, Issue 6, 2003, Pages 611-618

  Ahmadi, Amir ^a   Belk, Ryan ^b   Tamon, Christino ^c   Wendler, Carolyn ^d  

^a Clarkson University   (United States)

^b BINGHAMTON UNIVERSITY   (United States)

^c CLARKSON UNIVERSITY   (United States)

^d KENYON COLLEGE   (United States)

Author keywords

Continuous time quantum walks; Mixing; Quantum computing

Indexed keywords

CONTINUOUS TIME SYSTEMS; GRAPH STRUCTURES; GRAPHIC METHODS; MIXING; QUANTUM COMPUTERS;

CIRCULANT GRAPHS; COMPLETE GRAPHS; COMPLETE MULTIPARTITE GRAPH; CONTINUOUS-TIME QUANTUM WALKS; MIXING PROPERTY; QUANTUM COMPUTING; SYMMETRIC GROUPS; UNIFORM DISTRIBUTION;

GRAPH THEORY;

EID: 0344120640     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. A. Childs, E. Deotto, R. Cleve, E. Farhi, S. Gutmann, D. Spielman (2003), Exponential algorithmic speedup by quantum walk, in Proc. 35th Ann. Symp. Theory of Computing (ACM Press), p. 59.
2. I. Chuang and M. Nielsen (2000), Quantum Information and Quantum Computation, Cambridge University Press.
3. P. Diaconis (1988), Group Representations in Probability and Statistics, Institute of Mathematical Statistics.
4. R. Motwani and P. Raghavan (1995), Randomized Algorithms, Cambridge University Press.
5. E. Farhi and S. Gutmann (1998), Quantum computation and decision trees, Phys. Rev. A 58.
6. A. Childs, E. Farhi, and S. Gutmann (2002), An example of the difference between quantum and classical random walks, Quantum Information Processing 1, 35.
7. A. Ambainis, E. Bach, A. Nayak, A. Viswanath, and J. Watrous (2001), One-dimensional Quantum Walks, in Proc. 33rd ACM Ann. Symp. Theory Computing (ACM Press), p. 60.
8. D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani (2001), Quantum Walks on Graphs, in Proc. 33rd ACM Ann. Symp. Theory Computing (ACM Press), p. 50.
9. C. Moore and A. Russell (2002), Quantum Walks on the Hypercube, in Proc. 6th Int. Workshop Randomization and Approximation in Computer Science (Springer), p. 164.
10. J. Kempe (2002), Quantum Random Walks Hit Exponentially Faster, in quant-ph/0205083. To appear in RANDOM'03
11. G.R. Grimmett and D.R. Stirzaker (1982), Probability and Random Processes, Oxford University Press.
12. H. Gerhardt and J. Watrous (2003), Continuous-time quantum walks on the symmetric group, in. quant-ph/0305182. To appear, in RANDOM'03.