Continuous-time quantum walks on the symmetric group

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 290-301

  Gerhardt, Heath ^a   Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONTINUOUS TIME SYSTEMS; GRAPH THEORY; OPTIMIZATION;

CAYLEY GRAPHS; CONTINUOUS-TIME QUANTUM WALKS; DESTRUCTIVE INTERFERENCE; GENERATING SET; LIMITING DISTRIBUTIONS; QUANTUM WALK; SYMMETRIC GROUPS;

APPROXIMATION ALGORITHMS;

EID: 35248879710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_25     Document Type: Article

References (23)

1. D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 50-59, 2001.
2. D. Aharonov and A. Ta Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003.
3. A. Ahmadi, R. Belk, C. Tamon, and C. Wendler. Mixing in continuous quantum walks on graphs. arXiv.org e-Print quant-ph/0209106, 2002.
4. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs, 2002. See http://stat-www.berkeley.edu/users/aldous/RWG/book.html.
5. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 60-69, 2001.
6. E. Bach, S. Coppersmith, M. Goldschen, R. Joynt, and J. Watrous. One-dimensional quantum walks with absorbing boundaries. arXiv.org e-Print quant-ph/0207008, 2002.
7. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, pages 175-179, 1984.
8. A. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman. Exponential algorithmic speedup by quantum walk. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003.
9. A. Childs, E. Farhi, and S. Gutmann. An example of the difference between quantum and classical random walks. Quantum Information Processing, 1(35), 2002.
10. P. Diaconis. Group Representations in Probability and Statistics. Lecture Notes-Monograph Series. Institute of Mathematical Statistics, 1988.
11. E. Farhi and S. Gutmann. Quantum computation and decision trees. Physical Review A, 58:915-928, 1998.
12. M. Horodecki, P. Horodecki, and R. Horodecki. Mixed-state entanglement and quantum communication. In Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments, volume 173 of Springer Tracts in Modern Physics. Springer-Verlag, 2001.
13. R. Ingram. Some characters of the symmetric group. In Proc. Amer. Math. Soc., volume 1, pages 358-369, 1950.
14. G. James and A. Kerber. The Representation Theory of the Symmetric Group. Addison-Wesley, 1981.
15. J. Kempe. Quantum random walks hit exponentially faster. arXiv.org e-Print quant-ph/0205083, 2002.
16. J. Kempe. Quantum random walks - an introductory overview. Contemporary Physics, 2003. To appear. See also arXiv.org e-Print quant-ph/0303081.
17. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003.
18. T. Mackay, S. Bartlett, L. Stephenson, and B. Sanders. Quantum walks in higher dimensions. arXiv.org e-Print quant-ph/0108004, 2001.
19. C. Moore and A. Russell. Quantum walks on the hypercube. In Proceedings of the Sixth International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 2002.
20. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
21. P. Shor and J. Preskill. Simple proof of security of the BB84 quantum key distribution protocol. arXiv.org e-Print quant-ph/0003004, 2000.
22. S. Sternberg. Group Theory and Physics. Cambridge University Press, 1994.
23. T. Yamasaki, H. Kobayashi, and H. Imai. Analysis of absorbing times of quantum walks. arXiv.org e-Print quant-ph/0205045, 2002.