Quantum walks on general graphs

International Journal of Quantum Information

Volumn 4, Issue 5, 2006, Pages 791-805

  Kendon, Viv ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Quantum algorithms; Quantum information; Quantum walks

Indexed keywords

CONTINUOUS TIME SYSTEMS; QUANTUM COMPUTERS; QUANTUM THEORY;

CONTINUOUS-TIME; GENERAL GRAPH; PRIOR INFORMATION; QUANTUM ALGORITHMS; QUANTUM INFORMATION; QUANTUM WALK; RESOURCE REQUIREMENTS;

GRAPH STRUCTURES;

EID: 33845540663     PISSN: 02197499     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219749906002195     Document Type: Review

References (28)

1. A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proc. 35th Annual ACM STOC (ACM, New York, 2003), pp. 59-68.
2. N. Shenvi, J. Kempe and K. B. Whaley, A quantum random walk search algorithm, Phys. Rev. A 67 (2003) 052307.
3. J. Kempe, Quantum random walk algorithms, Contemp. Phys. 44 (3) (2003) 302-327.
4. R. Blume-Kohout, C. M. Caves and I. H. Deutsch, Climbing mount scalable: Physical resource requirements for a scalable quantum computer, Found. Phys. 32(11) (2002) 1641.
5. B. C. Travaglione and G. J. Milburn, Implementing the quantum random walk, Phys. Rev. A 65 (2002) 032310.
6. B. C. Sanders, S. D Bartlett, B. Tregenna and P. L. Knight, Quantum quincunx in cavity QED, Phys. Rev. A 67 (2003) 042305.
7. W. Dür, R. Raussendorf, V. M. Kendon and H.-J. Briegel, Quantum random walks in optical lattices, Phys. Rev. A 66 (2002) 052319.
8. V. M. Kendon and B. C. Sanders, Complementarity and quantum walks, Phys. Rev. A 71 (2004) 022307.
9. C. A. Ryan, M. Laforest, J. C. Boileau and R. Laflamme, Experimental implementation of discrete time quantum random walk on an NMR quantum information processor, Phys. Rev. A 72 (2005) 062317.
10. Y. Aharonov, L. Davidovich and N. Zagury, Quantum random walks, Phys. Rev. A 48(2) (1992) 1687-1690.
11. D. Aharanov, A. Ambainis, J. Kempe and U. Vazirani, Quantum walks on graphs, in Proc. 33rd Annual ACM STOC (ACM, NY, 2001), pp. 50-59.
12. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath and J. Watrous, One-dimensional quantum walks, in Proc. 33rd Annual ACM STOC (ACM, New York, 2001), pp. 60-69.
13. J. Watrous, Quantum simulations of classical random walks and undirected graph connectivity, J. Comp. Syst. Sci. 62(2) (2001) 376-391.
14. E. Farhi and S. Gutmann, Quantum computation and decison trees, Phys. Rev. A 58 (1998) 915-928.
15. A. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70 (2004) 022314.
16. A. M. Childs and J. Goldstone, Spatial search and the Dirac equation, Phys. Rev. A 70 (2004) 042312.
17. A. Ambainis, Quantum walks and their algorithmic applications, Int. J. Quant. Inform. 1(4) (2003) 507-518.
18. S. Severini, On the digraph of a unitary matrix, SIAM J. Matrix Anal. App. 25(1) (2003) 295-300.
19. S. Severini, Graphs of a unitary matrix, Ars Combinatoria (2006), accepted for publication.
20. S. Hallgren, Polynomial-time quantum algorithms for pell's equation and the principal ideal problem, in Proc. 34th STOC (ACM, New York, 2002), pp. 653-658.
21. D. A. Meyer, On the absense of homogeneous scalar unitary cellular automata, Phys. Lett. A 223(5) (1996) 337-340.
22. B. Tregenna, W. Flanagan, R. Maile and V. Kendon, Controlling discrete quantum walks: Coins and initial states, New J. Phys. 5 (2003) 83.
23. C. Moore and A. Russell, Quantum walks on the hypercube, in Proc. 6th Int. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '02), eds. J. D. P. Rolim and S. Vadhan (Springer, 2002), pp. 164-178.
24. J. Kempe, Quantum random walks hit exponentially faster, in Proc. 7th Int. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '03), Lecture Notes in Computer Science (Springer, Heidelberg, 2003).
25. A. Ahmadi, R. Belk, C. Tamon and C. Wendler, On mixing in continuous-time quantum walks on some circulant graphs, Quant. Inform. Comp. 3(6) (2003) 611-618.
26. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964) 23.
27. S. Lloyd, Universal quantum simulators, Science 273 (1996) 1073-1078.
28. F. W. Strauch, Connecting the discrete and continous-time quantum walks, quantph/0606050.