Quantum networks are often modelled using Schrödinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey, technically not too heavy, of several recent results which serve this purpose. Specifically, we consider approximations by means of “fat graphs”—in other words, suitable families of shrinking manifolds—and discuss convergence of the spectra and resonances in such a setting.
Abstract 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 conditions for quantum graphs, building on previous works on transparent boundary conditions for the stationary Schrödinger equation on a line. Physically relevant constraints that make the vertex transparent under boundary conditions in the form of (weight) continuity and Kirchhoff rules are derived using two approaches, where transparent boundary conditions for the time-independent Schrödinger equation are found. The latter is derived by extending the transparent boundary condition concept to the time-independent Schrödinger equation on driven quantum graphs. For the constant potential, these constraints are also obtained using the scattering approach. We also discuss how the eigenvalues and eigenfunctions of a quantum graph are influenced not only by its topology, but also by the shape/type of a potential when an external field is involved.
We consider the statics and dynamics of distinguishable spin-
21 systems on an arbitrary graph
G with
N vertices. In particular, we consider systems of quantum spins evolving according to one of two Hamiltonians: (i) the
XY Hamiltonian
HXY, which contains an
XY interaction for every pair of spins connected by an edge in
G; and (ii) the Heisenberg Hamiltonian
HHeis, which contains a Heisenberg interaction term for every pair of spins connected by an edge in
G. We find that the action of the
XY (respectively, Heisenberg) Hamiltonian on state space is equivalent to the action of the adjacency matrix (respectively, combinatorial Laplacian) of a sequence
Gk,
k=0,…,N of graphs derived from
G (with
G1=G). This equivalence of actions demonstrates that the dynamics of these two models is the same as the evolution of a free particle hopping on the graphs
Gk. Thus we show how to replace the complicated dynamics of the original spin model with simpler dynamics on a more complicated geometry. A simple corollary of our approach allows us to write an explicit spectral decomposition of the
XY model in a magnetic field on the path consisting of
N vertices. We also use our approach to utilize results from spectral graph theory to solve new spin models: the
XY model and Heisenberg model in a magnetic field on the complete graph.
In this paper, we investigate the convergence of the state of a quantum network to a consensus (symmetric) state. The state evolution of the quantum network with continuous-time swapping operators can be described by a Lindblad master equation, which also introduces an underlying interaction graph for the network. For a fixed quantum interaction graph, we prove that the state of a quantum network with continuous-time Markovian dynamics converges to a consensus state, with convergence rate given by the smallest nonzero eigenvalue of a matrix serving as the Laplacian of the quantum interaction graph. We show that this convergence rate can be optimized via standard convex programming given a fixed amount of edge weights. For switching quantum interaction graphs, we establish necessary and sufficient conditions for exponential quantum consensus and asymptotic quantum consensus, respectively. The convergence analysis is based on a bridge built between the proposed quantum consensus scheme and classical consensus dynamics, in that quantum consensus of n qubits naturally defines a consensus process on an induced classical graph with 22nnodes. Existing consensus results on classical networks can thus be adopted to establish the quantum consensus convergence.