Quantum graphs where back-scattering is prohibited
arXiv:0708.0839 · doi:10.1088/1751-8113/40/47/010
Abstract
We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.
15 pages
References in corpus (7)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- Kirchhoff's Rule for Quantum Wires
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Can One Hear the Shape of a Graph?
- Universal spectral statistics in quantum graphs
- Unitary stochastic matrix ensembles and spectral statistics
- Spectral Statistics for Quantum Graphs: Periodic Orbits and Combinatorics
Cited by in corpus (16)
- Trace Formulae and Spectral Statistics for Discrete Laplacians on Regular Graphs (I)
- Finite pseudo orbit expansions for spectral quantities of quantum graphs
- Narrow peaks of full transmission in simple quantum graphs
- Dirac Particles in Transparent Quantum Graphs: Tunable transport of relativistic quasiparticles in branched structures
- Experimental study of closed and open microwave waveguide graphs with preserved and partially violated time-reversal invariance
- Hermitian unitary matrices with modular permutation symmetry
- Mathematical Aspects of Vacuum Energy on Quantum Graphs
- Quantum ergodicity for quantum graphs without back-scattering
- Closed and open superconducting microwave waveguide networks as a model for quantum graphs
- Manakov system on metric graphs: Modeling the reflectionless propagation of vector solitons in networks
- Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
- Quantum graph vertices with permutation-symmetric scattering probabilities
- Inverse scattering problem for quantum graph vertices
- Locality for quantum systems on graphs depends on the number field
- Quantizing graphs, one way or two?
- Maximal scarring for eigenfunctions of quantum graphs