A simple method for finding the scattering coefficients of quantum graphs
From MaRDI portal
Abstract: Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the response of a subgraph to signals of different frequencies. In so doing we can replace an entire subgraph with a single vertex with frequency dependent scattering coefficients. In this paper a simple technique for quickly finding the scattering coefficients of any quantum graph will be presented. These scattering coefficients can be expressed entirely in terms of the characteristic polynomial of the graph's time step operator. Moreover, with these in hand we can easily derive the "impulse response" which is the key to predicting the response of a graph to any signal. This gives us a powerful set of tools for rapidly understanding the behavior of graphs or for reducing a large graph into its constituent subgraphs regardless of how they are connected.
Recommendations
Cites work
Cited in
(5)- Finding structural anomalies in complete graphs using scattering quantum walks
- Exact scattering matrix of graphs in magnetic field and quantum noise
- scientific article; zbMATH DE number 5082579 (Why is no real title available?)
- Scattering theory on graphs: II. The Friedel sum rule
- Direct computation of scattering matrices for general quantum graphs
This page was built for publication: A simple method for finding the scattering coefficients of quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192712)