Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics A Mathematical and General

Green function approach for general quantum graphs

Alexandre G. M. Schmidt, Bin Kang Cheng, M. G. E. da Luz

Published Oct 8, 2003• 28 citations
Publisher

Abstract

We present a recursive prescription to calculate the exact Green function for general quantum graphs. For the closed case, the expression for the poles of G —which gives the individual eigenstates—has the structure of a semiclassical formula, where the sum over the periodic orbit is already performed. As applications we discuss eigenstate localization for a three-arm closed star and filter-like mechanisms for transmission throughout an open trident graph.

DOI
10.1088/0305-4470/36/42/l01

Related papers

Green-function approach for scattering quantum walks

Fabiano M. Andrade, M. G. E. da Luz

In this work a Green-function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position-dependent quantum amplitudes. By introducing the step and path operators, it is shown how to extract any information about the system from the Green function. The method's relevant features are demonstrated by discussing in detail an example, a general diamond-shaped graph.

arXiv:1112.2614•Physical Review A•Oct 31, 2011•9 citations

The Green function for simplest quantum graphs

K.K. Sabirov, U. A. Aminov, Kh.Sh. Saparov +2 more

We treat the problem of the Green function for quantum graphs by focusing on such topologies as star and tree graphs.The exact Green function for the Schrödinger equation on primary star graphs is derived in the form of 3 × 3-matrix using the vertex boundary conditions providing continuity and current conservation.Extension of the approach for the derivation for the Green function on tree graph is presented.Possible practical applications of the obtained results are discussed.

Nanosystems Physics Chemistry Mathematics•Dec 21, 2015•1 citation

Green functions for generalized point interactions in one dimension: A scattering approach

Alexandre G. M. Schmidt, Bin Kang Cheng, M. G. E. da Luz

Recently, general point interactions in one dimension has been used to model a large number of different phenomena in quantum mechanics. Such potentials, however, require some sort of regularization to lead to meaningful results. The usual ways to do so rely on technicalities that may hide important physical aspects of the problem. In this work we present a method to calculate the exact Green functions for general point interactions in one dimension. Our approach differs from previous ones because it is based only on physical quantities, namely, the scattering coefficients R and T to construct G. Renormalization or particular mathematical prescriptions are not invoked. The simple formulation of the method makes it easy to extend to more general contexts, such as for lattices of N general point interactions, on a line, on a half-line, under periodic boundary conditions, and confined in a box.

arXiv:quant-ph/0211193•Physical Review A•Dec 31, 2002•32 citations

One-Dimensional Quantum Chaos: Explicitly Solvable Cases

Yuri A. Dabaghian, Roderick V. Jensen, R. Blümel

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level

•Jan 1, 2001•15 citations

One-dimensional quantum chaos: Explicitly solvable cases

Yu. Dabaghian, R. V. Jensen, R. Blümel

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs . Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level.

arXiv:quant-ph/0108054•Journal of Experimental and Theoretical Physics Letters•Aug 1, 2001•14 citations

Quantum Graphology

Tsampikos Kottos

We review quantum chaos on graphs.We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wave function statistics.This operator is the analogue of the classical evolution operator on the graph.It allows us to establish a connection between the corresponding periodic orbits and the statistical properties of eigenvalues and eigenfunctions.Specifically, for the energy-averaged spectral form factor we derived an exact combinatorial expression which illustrate the role of correlations between families of isometric orbits.We also show that enhanced wave function localization due to the presence of short unstable periodic orbits and strong scarring can rely on completely different mechanisms.

arXiv:nlin/0506051•Acta Physica Polonica A•Jan 1, 2006•6 citations
We present a recursive prescription to calculate the exact Green function for general quantum graphs. For the closed case, the expression for the poles of G —which gives the individual eigenstates—has the structure of a semiclassical formula, where the sum over the periodic orbit is already performed. As applications we discuss eigenstate localization for a three-arm closed star and filter-like mechanisms for transmission throughout an open trident graph.
In this work a Green-function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position-dependent quantum amplitudes. By introducing the step and path operators, it is shown how to extract any information about the system from the Green function. The method's relevant features are demonstrated by discussing in detail an example, a general diamond-shaped graph.
Recently, general point interactions in one dimension has been used to model a large number of different phenomena in quantum mechanics. Such potentials, however, require some sort of regularization to lead to meaningful results. The usual ways to do so rely on technicalities that may hide important physical aspects of the problem. In this work we present a method to calculate the exact Green functions for general point interactions in one dimension. Our approach differs from previous ones because it is based only on physical quantities, namely, the scattering coefficients R and T to construct G. Renormalization or particular mathematical prescriptions are not invoked. The simple formulation of the method makes it easy to extend to more general contexts, such as for lattices of N general point interactions, on a line, on a half-line, under periodic boundary conditions, and confined in a box.
We review quantum chaos on graphs.We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wave function statistics.This operator is the analogue of the classical evolution operator on the graph.It allows us to establish a connection between the corresponding periodic orbits and the statistical properties of eigenvalues and eigenfunctions.Specifically, for the energy-averaged spectral form factor we derived an exact combinatorial expression which illustrate the role of correlations between families of isometric orbits.We also show that enhanced wave function localization due to the presence of short unstable periodic orbits and strong scarring can rely on completely different mechanisms.