Superdiffusive quantum stochastic walk definable on arbitrary directed graph.

Krzysztof Domino Adam Glos Mateusz Ostaszewski

Published in: Quantum Inf. Comput. (2017)

Keyphrases

directed graph
random walk
graph structure
strongly connected
directed acyclic graph
maximum flow
undirected graph
graph structures
quantum inspired
quantum computing
markov chain
shortest path problem
transitive closure
quantum mechanics
transition matrix
web graph
quantum computation
probability ranking principle