Non-uniform mixing of Quantum walk on cycles

International Journal of Quantum Information

Volumn 5, Issue 6, 2007, Pages 781-793

  Adamczak, William ^a   Andrew, Kevin ^b   Bergen, Leon ^c   Ethier, Dillon ^d   Hernberg, Peter ^e   Lin, Jennifer ^f   Tamon, Christino ^g  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b HARVEY MUDD COLLEGE   (United States)

^c SWARTHMORE COLLEGE   (United States)

^d CLARKSON UNIVERSITY   (United States)

^e STATE UNIVERSITY OF NEW YORK AT POTSDAM   (United States)

^f PRINCETON UNIVERSITY   (United States)

^g Clarkson University   (United States)

Author keywords

Circulant; Continuous time; Mixing; Quantum walk

Indexed keywords

CONTINUOUS TIME SYSTEMS; MIXING;

CIRCULANT GRAPHS; CIRCULANTS; COMPLETE GRAPHS; CONTINUOUS-TIME; CONTINUOUS-TIME QUANTUM WALKS; MIXING PROPERTY; QUANTUM WALK; UNIFORM DISTRIBUTION;

GRAPH THEORY;

EID: 38049002002     PISSN: 02197499     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219749907003195     Document Type: Article

References (17)

1. V. Kendon, Quantum walks on general graphs, Int. J. Quant. Inform. 4(5) (2006) 791-805.
2. R. P. Feynman, R. B. Leighton and M. L. Sands, The Feynman Lectures on Physics, Vol. 3 (Addison-Wesley, U.S.A., 1965).
3. P. G. Doyle and J. L. Snell, Random Walks and Electric Networks (The Mathematical Association of America, U.S.A., 1984).
4. E. Farhi and S. Gutmann, Quantum computation and decision trees, Phys. Rev. A 58 (1998) 915-928.
5. A. M. Childs, R. E. Cleve, E. Deotto, E. Farhi, S. Gutmann and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proc. 35th Annual Symposium on the Theory of Computing (ACM Press, U.S.A., 2003), pp. 59-68.
6. C. Moore and A. Russell, Quantum walks on the hypercube, in Proc. 6th Int. Workshop on Randomization and Approximation in Computer Science, J. D. P. Rolim and S. P. Vadhan (eds.), Lecture Notes in Computer Science, Vol. 2483 (Springer-Verlag, Germany, 2002), pp. 164-178.
7. A. Ahmadi, R. Belk, C. Tamon and C. Wendler, On mixing of continuous-time quantum walks on some circulant graphs, Quant. Inform. Comput. 3 (2003) 611-618.
8. H. Gerhardt and J. Watrous, Continuous-time quantum walks on the symmetric group, in Proc. 7th Int. Workshop Randomization and Approximation in Computer Science, S. Arora, K. Jansen, J. D. P. Rolim and A. Sahai (eds.), Lecture Notes in Computer Science, Vol. 2764 (Springer-Verlag, Germany, 2003), pp. 290-301.
9. D. Aharonov, A. Ambainis, J. Kempe and U. Vazirani, Quantum walks on graphs, in Proc. 33rd ACM Annual Symposium on Theory of Computing (ACM Press, U.S.A., 2001), pp. 50-59.
10. M. Bednarska, A. Grudka, P. Kurzyński, T. Łuczak and A. Wójcik, Quantum walks on cycles, Phys. Lett. A 317 (2003) 21-25.
11. D. b.-Avraham, E. Bollt and C. Tamon, One-dimensional continuous-time quantum walks, Quant. Inform. Process. 3 (2004) 295-308.
12. P. Diaconis, Patterned matrices, in Matrix Theory and Applications Proceedings of Symposia in Applied Mathematics, Vol. 40 (American Mathematical Society, U.S.A., 1990), pp. 37-58.
13. P. J. Davis, Circulant Matrices, 2nd edn. (Chelsea, U.S.A., 1994).
14. P. Diaconis, Group Representations in Probability and Statistics (Institute of Mathematical Statistics, U.S.A., 1988).
15. N. Saxena, S. Severini and I. Shparlinski, Parameters of integral circulant graphs and periodic quantum dynamics, Int. J. Quant. Inform. 5 (2007) 417-430.
16. N. Biggs, Algebraic Graph Theory, 2nd edn. (Cambridge University Press, U.S.A., 1993).
17. I. Niven, Irrational Numbers (The Mathematical Association of America, U.S.A., 1985).