Circuit equation of Grover walk

• URL: http://arxiv.org/abs/2211.00920v1
• Date: Wed, 2 Nov 2022 07:07:30 GMT
• Title: Circuit equation of Grover walk
• Authors: Yusuke Higuchi and Etsuo Segawa
• Abstract summary: We consider the Grover walk on the infinite graph in which an internal finite subgraph receives the inflow from the outside with some frequency. We characterize the scattering on the surface of the internal graph and the energy penetrating inside it. For the complete graph as the internal graph, we illustrate the relationship of the scattering and the internal energy to the frequency and the number of tails.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the Grover walk on the infinite graph in which an internal finite subgraph receives the inflow from the outside with some frequency and also radiates the outflow to the outside. To characterize the stationary state of this system, which is represented by a function on the arcs of the graph, we introduce a kind of discrete gradient operator twisted by the frequency. Then we obtain a circuit equation which shows that (i) the stationary state is described by the twisted gradient of a potential function which is a function on the vertices; (ii) the potential function satisfies the Poisson equation with respect to a generalized Laplacian matrix. Consequently, we characterize the scattering on the surface of the internal graph and the energy penetrating inside it. Moreover, for the complete graph as the internal graph, we illustrate the relationship of the scattering and the internal energy to the frequency and the number of tails.

Related papers

• Advective Diffusion Transformers for Topological Generalization in Graph Learning [69.2894350228753]
  We show how graph diffusion equations extrapolate and generalize in the presence of varying graph topologies. We propose a novel graph encoder backbone, Advective Diffusion Transformer (ADiT), inspired by advective graph diffusion equations.
  arXiv  Detail & Related papers  (2023-10-10T08:40:47Z)
• Closed form expressions for the Green's function of a quantum graph -- a scattering approach [0.0]
  We present a three step procedure for generating a closed form expression of the Green's function on quantum graphs. For compact graphs, we show that the explicit expression is equivalent to the spectral decomposition as a sum over poles at the discrete energy eigenvalues.
  arXiv  Detail & Related papers  (2023-09-20T12:22:32Z)
• Path distributions for describing eigenstates of the harmonic oscillator and other 1-dimensional problems [0.0]
  An integral expression is written that describes the wave function. The resulting expression can be analyzed using a generalization of stationary-phase analysis. A somewhat broad distribution is found, peaked at value of momentum that corresponds to a classical energy.
  arXiv  Detail & Related papers  (2023-06-19T20:40:26Z)
• Dynamical chaos in nonlinear Schr\"odinger models with subquadratic power nonlinearity [137.6408511310322]
  We deal with a class of nonlinear Schr"odinger lattices with random potential and subquadratic power nonlinearity. We show that the spreading process is subdiffusive and has complex microscopic organization. The limit of quadratic power nonlinearity is also discussed and shown to result in a delocalization border.
  arXiv  Detail & Related papers  (2023-01-20T16:45:36Z)
• A comfortable graph structure for Grover walk [0.0]
  We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths. We give some characterization upon the scattering of the stationary state on the surface of the internal graph. We introduce a comfortability function of a graph for the quantum walk, which shows how many walkers can stay in the interior.
  arXiv  Detail & Related papers  (2022-01-06T05:29:50Z)
• Non-separable Spatio-temporal Graph Kernels via SPDEs [90.62347738138594]
  We provide graph kernels for principled-temporal modelling on graphs. By providing novel tools for modelling on graphs, we outperform pre-existing graph kernels in real-world applications.
  arXiv  Detail & Related papers  (2021-11-16T14:53:19Z)
• Exact thermal properties of free-fermionic spin chains [68.8204255655161]
  We focus on spin chain models that admit a description in terms of free fermions. Errors stemming from the ubiquitous approximation are identified in the neighborhood of the critical point at low temperatures.
  arXiv  Detail & Related papers  (2021-03-30T13:15:44Z)
• Exponentially confining potential well [0.0]
  We introduce an exponentially confining potential well that could be used as a model to describe the structure of a strongly localized system. We obtain an approximate partial solution of the Schr"odinger equation with this potential well where we find the lowest energy spectrum and corresponding wavefunctions.
  arXiv  Detail & Related papers  (2020-05-15T17:10:35Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)
• Approximate quantum fractional revival in paths and cycles [0.0]
  We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs.
  arXiv  Detail & Related papers  (2020-05-01T17:07:17Z)
• Asymptotic entropy of the Gibbs state of complex networks [68.8204255655161]
  The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random ErdHos-R'enyi graphs.
  arXiv  Detail & Related papers  (2020-03-18T18:01:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.