Quantum walks on directed graphs
Quantum Physics
2007-05-23 v1
Abstract
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. 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.
Keywords
Cite
@article{arxiv.quant-ph/0504116,
title = {Quantum walks on directed graphs},
author = {Ashley Montanaro},
journal= {arXiv preprint arXiv:quant-ph/0504116},
year = {2007}
}
Comments
10 pages, some xypic figures