Related papers: Quantum graph vertices with permutation-symmetric …
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
The topological quantum number Q of a superconducting or chiral insulating wire counts the number of stable bound states at the end points. We determine Q from the matrix r of reflection amplitudes from one of the ends, generalizing the…
We consider functional-integral quantisation of the moduli of all quantum metrics defined as square-lengths $a$ on the edges of a Lorentzian square graph. We determine correlation functions and find a fixed relative uncertainty $\Delta…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We study the distribution of transmission eigenvalues of a quantum point contact with nearby impurities. In the semi-classical case (the chemical potential lies at the conductance plateau) we find that the transmission properties of this…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…
We consider quantum graphs with spin-orbit couplings at the vertices. Time-reversal invariance implies that the bond S-matrix is in the orthogonal or symplectic symmetry class, depending on spin quantum number s being integer or…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
Scattering through a straight two-dimensional quantum waveguide Rx(0,d) with Dirichlet boundary conditions on (-\infty,0)x{y=0} \cup (0,\infty)x{y=d} and Neumann boundary condition on (-infty,0)x{y=d} \cup (0,\infty)x{y=0} is considered…
We study the effects of an arbitrary external perturbation in the statistical properties of the S-matrix of quantum chaotic scattering systems in the limit of isolated resonances. We derive, using supersymmetry, an exact non-perturbative…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…
We apply the quotient graph theory described by Band, Berkolaiko, Joyner and Liu to particular graphs symmetric with respect to $S_3$ and $C_3$ symmetry groups. We find the quotient graphs for the three-edge star quantum graph with Neumann…
We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…