Mixing of quantum walk on circulant bunkbeds

Quantum Information and Computation

Volumn 6, Issue 4-5, 2006, Pages 370-381

  Lo, Peter ^a   Rajaram, Siddharth ^b   Schepens, Diana ^c   Sullivan, Daniel ^d   Tamon, Christino ^e   Ward, Jeffrey ^f  

^a ST MARY'S COLLEGE OF MARYLAND   (United States)

^b MIDDLEBURY COLLEGE   (United States)

^c HOUGHTON COLLEGE   (United States)

^d SWARTHMORE COLLEGE   (United States)

^e Clarkson University   (United States)

^f CLARKSON UNIVERSITY   (United States)

Author keywords

Circulants; Continuous time; Mixing; Quantum walks

Indexed keywords

CONTINUOUS TIME SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; PROBABILITY DISTRIBUTIONS; SET THEORY;

CARTESIAN PRODUCTS; CIRCULANTS; COMPLETE MULTIPARTITE GRAPH; CONTINUOUS-TIME; CONTINUOUS-TIME QUANTUM WALKS; EXPLICIT ANALYSIS; MIXING DYNAMICS; QUANTUM WALK;

MIXING;

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

References (18)

1. Dorit Aharonov, Andris Ambainis, Julia Kempe, and Umesh Vazirani, Quantum Walks on Graphs," Proc. 33rd ACM Annual Symposium on Theory of Computing (2001), 50-59.
2. William Adamczak, Kevin Andrew, Peter Hernberg, and Christine Tamon, "A note on graphs resistant to quantum mixing," quant-ph/0308073.
3. Amir Ahmadi, Ryan Belk, Christine Tamon, and Carolyn Wendler, "On Mixing of Continuous-Time Quantum Walks on Some Circulant Graphs," Quantum Information and Computation 3 (2003), 611-618.
4. David Aldous and James Alien Fill, Reversible Markov Chains and Random Walks on Graphs, book draft at http://stat-www.berkeley.edu/users/aldous/RWG/ book.html.
5. Norman Biggs, Algebraic Graph Theory, 2nd edition, Cambridge University Press, 1993.
6. Béla Bollobás, Modern Graph Theory, Springer, 1998.
7. Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman, "Exponential algorithmic speedup by a quantum walk," Proc. 35th ACM Annual Symposium on the Theory of Computing (2003), 59-68.
8. Persi Diaconis, "Patterned Matrices," in Matrix Theory and Applications, Proceedings of Symposia in Applied Mathematics 40, American Mathematical Society (1990), 37-58.
9. Wolfgang Dur, Robert Raussendorf, Vivien M. Kendon, Hans J. Briegel, "Quantum walks in optical lattices," Physical Review A 66 (2002), 052319.
10. Richard P. Feynman, Robert B. Leighton, Matthew L. Sands, The Feynman Lectures on Physics, volume III, Addison-Wesley, 1965.
11. Heath Gerhardt and John Watrous, "Continuous-time quantum walks on the symmetric group," in Proc. 7th Int. Workshop Randomization and Approximation in Computer Science, Lecture Notes in Computer Science 2764, Springer (2003), 290-301.
12. Vivien M. Kendon, "Quantum walks on general graphs," quant-ph/0306140.
13. László Lovász, Combinatorial Problems and Exercises, 2nd edition, North-Holland, 1993.
14. Laszlo Lovász, "Random Walks on Graphs: A Survey," in Combinatorics: Paul Erdös is Eighty, volume 2, Bolyai Society of Mathematical Studies (1993), 1-46.
15. Cristopher Moore and Alexander Russell, "Quantum Walks on the Hypercube," in Proc. 6th Int. Workshop on Randomization and Approximation in Computer Science, Lecture Notes in Computer Science 2483, Springer (2002), 164-178.
16. Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
17. Allen J. Schwenk and Robin J. Wilson, "Eigenvalues of Graphs," in Selected Topics in Graph Theory, Lowell W. Beineke and Robin J. Wilson (eds.), Academic Press (1978), 307-336.
18. Frank Spitzer, Principles of Random Walk, 2nd edition, Springer, 1976.