Simone Severini and Gregor Tanner 2004 J. Phys. A: Math. Gen. 37 6675 doi:10.1088/0305-4470/37/26/005
Simone Severini1 and Gregor Tanner2
Show affiliationsWe 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 controlled easily. The method may find applications in the study of quantum random walks and may also prove to be useful in analysing universality in spectral statistics.
05.45.Mt Quantum chaos; semiclassical methods
03.67.Lx Quantum computation architectures and implementations
81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)
Issue 26 (2 July 2004)
Received 15 December 2003, in final form 14 May 2004
Published 16 June 2004
Simone Severini and Gregor Tanner 2004 J. Phys. A: Math. Gen. 37 6675
R J S Lee and D S F Crothers 2001 J. Phys. B: At. Mol. Opt. Phys. 34 L687
G Dell'Antonio, P Exner and V Geyler 2004 J. Phys. A: Math. Gen. 37
S G Schirmer et al 2002 J. Phys. A: Math. Gen. 35 8551
Francisco J Herranz and Mariano Santander 2002 J. Phys. A: Math. Gen. 35 6619
Wen-bin Fan et al 2006 J. Phys.: Condens. Matter 18 3367
J. S. Lazendic et al. 2006 ApJ 651 250
Gregor Tanner and Niels Søndergaard 2007 J. Phys. A: Math. Theor. 40 R443
Z G Xiao et al 2007 J. Phys. G: Nucl. Part. Phys. 34 S915
M Berrada et al 2009 Inverse Problems 25 115016