Related papers: PT-symmetric quantum graphs
We propose a noncommutative version of the Euclidean Lie algebra $E_2$. Several types of non-Hermitian Hamiltonian systems expressed in terms of generic combinations of the generators of this algebra are investigated. Using the breakdown of…
PT-symmetric Hamiltonians and transfer matrices arise naturally in statistical mechanics. These classical and quantum models often require the use of complex or negative weights and thus fall outside of the conventional equilibrium…
We study the spectrum of a quantum star graph with a non-selfadjoint Robin condition at the central vertex. We first prove that, in the high frequency limit, the spectrum of the Robin Laplacian is close to the usual spectrum corresponding…
We examine transmission through a quantum graph vertex to which auxiliary edges with constant potentials are attached. We find a characterization of vertex couplings for which the transmission probability from a given "input" line to a…
Hyperbolic systems on networks often can be written as systems of first order equations on an interval, coupled by transmission conditions at the endpoints, also called port-Hamiltonians. However, general results for the latter have been…
We propose a $PT$-symmetrically deformed version of the graphene tight-binding model under a magnetic field. We analyze the structure of the spectra and the eigenvectors of the Hamiltonians around the $K$ and $K'$ points, both in the…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
In a thin multidimensional layer we consider a second order differential PT-symmetric operator. The operator is of rather general form and its coefficients are arbitrary functions depending both on slow and fast variables. The PT-symmetry…
We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…
We generalize the known solution of the Schr\"odinger equation, describing a particle confined to a triangular area, for a triangular graphene quantum dot with armchair-type boundaries. The quantization conditions, wave functions, and the…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
Quantum bound-state energies are assumed generated by PT-symmetric Hamiltonians H where P is, typically, parity. It is known that their spectrum only remains real and observable (i.e., in the language of physics, the PT-symmetry remains…
Extended quantum mechanics using non-Hermitian, pseudo-Hermitian Hamiltonians is briefly reviewed. Supersymmetric regularizations, solvable simulations and large-N expansion techniques are recollected as suitable means for the study of…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We consider one-dimensional Schr\"odinger equations with homogeneous potential, under appropriate PT-symmetric boundary conditions. We prove the phenomenon which was discovered by Bender and Boettcher by numerical computation: as the degree…
One of the postulates of quantum mechanics is that the Hamiltonian is Hermitian, as this guarantees that the eigenvalues are real. Recently there has been an interest in asking if $H^\dagger = H$ is a necessary condition, and has lead to…