A trace formula for metric graphs with piecewise constant potentials and multi-mode graphs

• URL: http://arxiv.org/abs/2201.06963v1
• Date: Tue, 18 Jan 2022 13:22:52 GMT
• Title: A trace formula for metric graphs with piecewise constant potentials and multi-mode graphs
• Authors: Sven Gnutzmann and Uzy Smilansky
• Abstract summary: We generalize the scattering approach to quantum graphs to quantum graphs with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and Smilansky.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We generalize the scattering approach to quantum graphs to quantum graphs with with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and Smilansky. By introducing an effective reduced scattering picture we are able to introduce new exact trace formulas in the more general setting. The latter are derived and discussed in details with some numerical examples for illustration. Our generalization is motivated by both experimental applications and fundamental theoretical considerations. The free single-mode quantum graphs are an extreme idealization of reality that, due to the simplicity of the model allows to understand a large number of generic or universal phenomena. We lift some of this idealization by considering the influence of evanescent modes that only open above threshold energies. How to do this theoretically in a closed model in general is a challenging question of fundamental theoretical interest and we achieve this here for quantum graphs.

Related papers

• Discrete Schrodinger equation on graphs: An effective model for branched quantum lattice [0.0]
  We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and derivation of secular equation for arbitrary quantum graphs is presented.
  arXiv  Detail & Related papers  (2024-11-21T18:27:18Z)
• Graph Generation via Spectral Diffusion [51.60814773299899]
  We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• 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)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Generalized energy and gradient flow via graph framelets [27.71018932795014]
  We provide a theoretical understanding of the framelet-based graph neural networks through the perspective of energy gradient flow. By viewing the framelet-based models as discretized gradient flows of some energy, we show it can induce both low-frequency and high-frequency-dominated dynamics.
  arXiv  Detail & Related papers  (2022-10-08T23:40:45Z)
• Understanding convolution on graphs via energies [23.18124653469668]
  Graph Networks (GNNs) typically operate by message-passing, where the state of a node is updated based on the information received from its neighbours. Most message-passing models act as graph convolutions, where features are mixed by a shared, linear transformation before being propagated over the edges. On node-classification tasks, graph convolutions have been shown to suffer from two limitations: poor performance on heterophilic graphs, and over-smoothing.
  arXiv  Detail & Related papers  (2022-06-22T11:45:36Z)
• Bandwidth Enables Generalization in Quantum Kernel Models [16.940180366663903]
  Recent results show that generalization of quantum models is hindered by the exponential size of the quantum feature space. We show that changing the value of the bandwidth can take a model from provably not being able to generalize to any target function to good generalization for well-aligned targets.
  arXiv  Detail & Related papers  (2022-06-14T08:41:08Z)
• Free-Fermion Subsystem Codes [0.3222802562733786]
  We consider quantum error-correcting subsystem codes whose gauge generators realize a free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of the code. We present the first known example of an exactly solvable spin model with a two-dimensional free-fermion description and exact topological qubits.
  arXiv  Detail & Related papers  (2022-01-18T19:00:04Z)
• Hyperbolic Variational Graph Neural Network for Modeling Dynamic Graphs [77.33781731432163]
  We learn dynamic graph representation in hyperbolic space, for the first time, which aims to infer node representations. We present a novel Hyperbolic Variational Graph Network, referred to as HVGNN. In particular, to model the dynamics, we introduce a Temporal GNN (TGNN) based on a theoretically grounded time encoding approach.
  arXiv  Detail & Related papers  (2021-04-06T01:44:15Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.