Regular quantum graphs
Authors:
- 17 June 2004
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 37 (26) , 6675-6686
Abstract
We 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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Quantum random walks: An introductory overviewContemporary Physics, 2003
- Families of Line-Graphs and Their QuantizationJournal of Statistical Physics, 2003
- On the Digraph of a Unitary MatrixSIAM Journal on Matrix Analysis and Applications, 2003
- Graph models for waves in thin structuresWaves in Random Media, 2002
- Two-point spectral correlations for star graphsJournal of Physics A: General Physics, 1999
- Periodic Orbit Theory and Spectral Statistics for Quantum GraphsAnnals of Physics, 1999
- Eigenvalue Spacings for Regular Graphs1999
- Quantum Chaos on GraphsPhysical Review Letters, 1997
- Line Digraph Iterations and the (d, k) Digraph ProblemIEEE Transactions on Computers, 1984
- Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation LawsPhysical Review Letters, 1984