Quantum walks on directed graphs

Simple item page
dc.creatorMontanaro, Ashley
dc.date2005-04-15
dc.date.accessioned2026-07-07T07:55:14Z
dc.date.available2026-07-07T07:55:14Z
dc.descriptionWe 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.
dc.description10 pages, some xypic figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0504116
dc.identifierhttp://arxiv.org/abs/quant-ph/0504116
dc.identifierQuantum Information and Computation, vol. 7, no. 1 (2007)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126899
dc.subjectQuantum Physics
dc.titleQuantum walks on directed graphs
dc.typetext

Files

Collections

arXiv