Related papers: PT-symmetric quantum graphs
The relevance of parity and time reversal (PT)-symmetric structures in optical systems is known for sometime with the correspondence existing between the Schrodinger equation and the paraxial equation of diffraction where the time parameter…
We introduce the notion of PT-symmetry in magnetic nanostructures and show that they can support a new type of non-Hermitian dynamics. Using the simplest possible set-up consisting of two coupled ferromagnetic films, one with loss and…
The original Calogero and Sutherland models describe N quantum particles on the line interacting pairwise through an inverse square and an inverse sinus-square potential. They are well known to be integrable and solvable. Here we extend the…
The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…
A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…
We carry out an exact quantization of a PT symmetric (reversible) Li\'{e}nard type one dimensional nonlinear oscillator both semiclassically and quantum mechanically. The associated time independent classical Hamiltonian is of non-standard…
By rearrangements of waveguide arrays with gain and losses one can simulate transformations among parity-time (PT-) symmetric systems not affecting their pure real linear spectra. Subject to such transformations, however, the nonlinear…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
Motivated by the theory of quantum waveguides, we investigate the spectrum of the Laplacian, subject to Dirichlet boundary conditions, in a curved strip of constant width that is defined as a tubular neighbourhood of an infinite curve in a…
We consider the quantum graph Hamiltonian on the square lattice in Euclidean space, and we show that the spectrum of the Hamiltonian converges to the corresponding Schr\"odinger operator on the Euclidean space in the continuum limit, and…
We investigate properties of the transmission amplitude of quantum graphs and microwave networks composed of regular polygons such as triangles and squares. We show that for the graphs composed of regular polygons with the edges of the…
In this paper, we consider the spectrum of a model in quantum electrodynamics with a spatial cutoff. It is proven that (1) the Hamiltonian is self-adjoint; (2) under the infrared regularity condition, the Hamiltonian has a unique ground…
We briefly explain some simple arguments based on pseudo Hermiticity, supersymmetry and PT-symmetry which explain the reality of the spectrum of some non-Hermitian Hamiltonians. Subsequently we employ PT-symmetry as a guiding principle to…
It is well known that a graph $G$ has a symmetric spectrum if and only if it is bipartite, a signed graph $\Gamma=(G,\sigma)$ has a symmetric spectrum if $G$ is bipartite. However, there exists a spectrally symmetric signed graph…
The dynamics of open quantum systems is determined by avoided and true crossings of eigenvalue trajectories of a non-Hermitian Hamiltonian. The phases of the eigenfunctions are not rigid so that environmentally induced spectroscopic…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We show the presence of a dense pure point spectrum on quantum graphs with Maryland-type quasiperiodic Kirchhoff coupling constants at the vertices.
In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…