Regular quantum graphs

Simple item page
dc.creatorSeverini, Simone
dc.creatorTanner, Gregor
dc.date2003-12-12
dc.date.accessioned2026-07-07T08:08:55Z
dc.date.available2026-07-07T08:08:55Z
dc.descriptionWe introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way incoming and outgoing channels at vertex scattering processes are connected. Symmetry properties of the quantum graph as well as its spectral statistics depend on the particular choice of permutation matrices, also called connectivity matrices, and can now be easily controlled. The method may find applications in the study of quantum random walks networks and may also prove to be useful in analysing universality in spectral statistics.
dc.description12 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/nlin/0312031
dc.identifierhttp://arxiv.org/abs/nlin/0312031
dc.identifier2004 J. Phys. A: Math. Gen. 37 6675-6686
dc.identifierdoi:10.1088/0305-4470/37/26/005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131428
dc.subjectChaotic Dynamics
dc.subjectQuantum Physics
dc.titleRegular quantum graphs
dc.typetext

Files

Collections

arXiv