skip to main content

Title: A simple method for finding the scattering coefficients of quantum graphs

Quantum walks are roughly analogous to classical random walks, and similar to 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 doing so, we can replace an entire subgraph with a single vertex with variable scattering coefficients. In this paper, a simple technique for quickly finding the scattering coefficients of any discrete-time 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. This is a marked improvement over previous techniques which have traditionally required finding eigenstates for a given eigenvalue, which is far more computationally costly. With the scattering coefficients 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.
Authors:
 [1]
  1. Department of Physics and Astronomy, Hunter College of the City University of New York, New York, New York 10065 (United States)
Publication Date:
OSTI Identifier:
22479599
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal of Mathematical Physics; Journal Volume: 56; Journal Issue: 9; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; DIAGRAMS; EIGENSTATES; EIGENVALUES; GRAPH THEORY; POLYNOMIALS; PULSES; RANDOMNESS; SCATTERING; SIGNALS