Quantum simulations of classical random walks and undirected graph connectivity
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Walks on the Hypercube
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the Digraph of a Unitary Matrix
SIAM Journal on Matrix Analysis and Applications
Quantum Walk Algorithm for Element Distinctness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum algorithms for subset finding
Quantum Information & Computation
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
Exploring scalar quantum walks on Cayley graphs
Quantum Information & Computation
Quantum walks: a comprehensive review
Quantum Information Processing
Hi-index | 0.00 |
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (vi, vj), if vi is connected to vj then there is a path from vj to vi. We show that reversibility is a necessary and sufficient condition for a directed graph to allow the notion of a discrete-time quantum walk, and discuss some implications of this condition. We present a method for defining a "partially quantum" walk on directed graphs that are not reversible.