Related papers: Green's function approach for quantum graphs: an o…
A new expression for the Green's function of a finite one-dimensional lattice with nearest neighbor interaction is derived via discrete Fourier transform. Solution of the Heisenberg spin chain with periodic and open boundary conditions is…
Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…
The calculation of work distributions in a quantum many-body system is of significant importance and also of formidable difficulty in the field of nonequilibrium quantum statistical mechanics. To solve this problem, inspired by…
The algorithm to calculate the generating function for the number of ``skeleton'' diagrams for the irreducible self-energy and vertex parts is derived for the problems with Gaussian random fields. We find an exact recurrence relation…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Graph Neural Networks (GNNs) are powerful machine learning models that excel at analyzing structured data represented as graphs, demonstrating remarkable performance in applications like social network analysis and recommendation systems.…
The validity of semiclassical expansions in the power of $\hbar$ for the quantum Green's function have been extensively tested for billiards systems, but in the case of chaotic dynamics with smooth potential, even if formula are existing, a…
Relativistic mean field theory is formulated with the Green's function method in coordinate space to investigate the single-particle bound states and resonant states on the same footing. Taking the density of states for free particle as a…
Previous work in the literature has studied gravitational radiation in black-hole collisions at the speed of light. In particular, it had been proved that the perturbative field equations may all be reduced to equations in only two…
Application of the background-field method to QCD and the electroweak Standard Model yields gauge-invariant effective actions giving rise to simple Ward identities. Within this method, we calculate the quantities that have been treated in…
We study the scattering of particles and quasiparticles in the framework of algebraic quantum field theory. The main novelty is the construction of inclusive scattering matrix related to inclusive cross-sections. The inclusive scattering…
We study the many-body physics of different quantum systems using a hierarchy of correlations, which corresponds to a generalization of the $1/\mathcal{Z}$ hierarchy. The decoupling scheme obtained from this hierarchy is adapted to…
Dynamical potentials appear in many advanced electronic-structure methods, including self-energies from many-body perturbation theory, dynamical mean-field theory, electronic-transport formulations, and many embedding approaches. Here, we…
A new scheme has been proposed to solve the B.E. condenstates in terms of Green's function approach. It has been shown that the radial wave function of two interacting atoms, moving in a common harmonic oscillator potential modified by an…
We discuss the general form of the transmission spectrum through a molec- ular junction in terms of the Green function of the isolated molecule. By introducing a tight binding method, we are able to translate the Green func- tion properties…
A method for the computation of scattering data and of the Green function for the one-dimensional Schr\"{o}dinger operator $H:=-\frac{d^2}{dx^2}+q(x)$ with a decaying potential is presented. It is based on representations for the Jost…
During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to…
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, the absolute zeta function can be considered as a zeta function over F_1. This paper presents a connection between the quantum walk and the absolute…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…