Quantum walks on directed graphs

Quantum Information and Computation

Volumn 7, Issue 1-2, 2007, Pages 93-102

  Montanaro, Ashley ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Quantum walks; Reversibility

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

DISCRETE TIME; QUANTUM WALK; REVERSIBILITY;

DIRECTED GRAPHS;

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

References (24)

1. D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani (2001), Quantum walks on graphs, Proc. STOC '01, pp. 50-59, quant-ph/0012090
2. E. Farhi, S. Gutmann (1998), Quantum computation and decision trees, Phys. Rev. A 58, pp. 915-928, 1998, quant-ph/9706062
3. J. Kempe (2003), Quantum random walks - an introductory overview, Contemporary Physics 44, pp. 307-327, quant-ph/0303081
4. N. Shenvi, J. Kempe, K. Whaley (2003), A quantum random walk search algorithm, Phys. Rev. A 67:052307, quant-ph/0210064
5. A. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. Spielman (2003), Exponential algorithmic speedup by quantum walk, Proc. STOC '03, pp. 59-68, quant-ph/0209131
6. A. Ambainis (2003), Quantum walk algorithm for element distinctness, Proc. FOCS '04, pp. 22-31, quant-ph/0311001
7. A. Childs, J. Eisenberg (2005), Quantum algorithms for subset finding, Quantum Information and Computation 5:593, quant-ph/0311038
8. F. Magniez, M. Santha, M. Szegedy (2005), Quantum algorithms for the triangle problem, Proc. SODA '05, pp. 1109-1117, quant-ph/0310134
9. C. Papadimitriou (1994), Computational complexity, Addison-Wesley.
10. J. Watrous (2001), Quantum simulations of classical random walks and undirected graph connectivity, Journal of Computer and System Sciences 62:2, pp. 376-391, quant-ph/9812012
11. W. K. Chen (1996), Graph theory and its engineering applications, Singapore: World Scientific.
12. F. Kelly (1979), Reversibility and stochastic networks, Wiley.
13. S. Severini (2003), Graphs of unitary matrices, math.CO/0303084
14. S. Severini (2003), On the digraph of a unitary matrix, SIAM Journal on Matrix Analysis and Applications, 25:1, pp. 295-300, math.CO/0205187
15. Y. Aharonov, L. Davidovich, N. Zagury (1992), Quantum random walks, Phys. Rev. A 48:1687.
16. S. Severini (2002), The underlying digraph of a coined quantum random walk, quant-ph/0210055
17. O. Lopez Acevedo, T. Gobron (2006), Quantum walks on Cayley graphs, J. Phys. A: Math. Gen. 39, pp. 585599, quant-ph/0503078
18. M. Szegedy (2004), Quantum speed-up of Markov chain based algorithms, Proc. FOCS '04, pp. 32-41
19. P. Bocchieri, A. Loinger (1957), Quantum recurrence theorem. Phys. Rev. 107, 337.
20. C. Moore, A. Russell (2002), Quantum walks on the hypercube, Proc. RANDOM '02. LNCS 2483, pp. 164-178, quant-ph/0104137
21. B. Tregenna, W. Flanagan, R. Maile, V. Kendon (2003), Controlling discrete quantum walks: coins and initial states, New J. Phys. 5:83, quant-ph/0304204
22. H. Krovi, T. Brun (2006), Hitting time for quantum walks on the hypercube, Phys. Rev. A 73:032341, quant-ph/0510136
23. O. Reingold (2005), Undirected ST-Connectivity in log-space, Proc. STOC '05, pp. 376-385
24. U. Schöning (1999), A probabilistic algorithm for k-SAT and constraint satisfaction problems, Proc. FOCS '99, pp. 410-414.