Related papers: Quantum graph vertices with permutation-symmetric …
Quantum graphs were introduced to model free electrons in organic molecules using a self-adjoint Hamiltonian on a network of intervals. A second graph quantization describes wave propagation on a graph by specifying scattering matrices at…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…
We discuss formulations of boundary conditions in a quantum graph vertex and demonstrate that the so-called $ST$-form can be further reduced up to a form more effective in certain applications: In particular, in identifying the number of…
We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…
We consider boundary conditions at the vertex of a star graph which make Schroedinger operators on the graph self-adjoint, in particular, the two-parameter family of such conditions invariant with respect to permutations of graph edges. It…
In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
We study the interplay between crossing symmetry and entanglement in $2 \to 2$ scattering within local quantum field theories that possess an $SU(N)$ global symmetry. In particular, we recast scattering amplitudes of fixed helicity as…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…
The probability of a quantum particle being detected in a given solid angle is determined by the $S$-matrix. The explanation of this fact in time dependent scattering theory is often linked to the quantum flux, since the quantum flux…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
We examine scattering properties of singular vertex of degree $n=2$ and $n=3$, taking advantage of a new form of representing the vertex boundary condition, which has been devised to approximate a singular vertex with finite potentials. We…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…