Inefficient quantum walks on networks: the role of the density of states

Simple item page
dc.creatorMuelken, Oliver
dc.date2007-10-18
dc.date.accessioned2026-07-07T08:37:01Z
dc.date.available2026-07-07T08:37:01Z
dc.descriptionWe show by general arguments that networks whose density of states contains few highly degenerate eigenvalues result in inefficient performances of continuous-time quantum walks (CTQW) over these networks, while systems whose eigenvalues all have the same degeneracy lead to very efficient transport. We exemplify our results by considering CTQW and, for comparison, its classical counterpart, continuous-time random walks, over simple structures, whose eigenvalues and eigenstates can be calculated analytically. Extensions to more complicated, hyper-branched networks are discussed.
dc.description6 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0710.3453
dc.identifierhttp://arxiv.org/abs/0710.3453
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140265
dc.subjectQuantum Physics
dc.subjectStatistical Mechanics
dc.titleInefficient quantum walks on networks: the role of the density of states
dc.typetext

Files

Collections

arXiv