Quantum graph explained

In mathematics and physics, a quantum graph is a linear, network-shaped structure of vertices connected on edges (i.e., a graph) in which each edge is given a length and where a differential (or pseudo-differential) equation is posed on each edge. An example would be a power network consisting of power lines (edges) connected at transformer stations (vertices); the differential equations would then describe the voltage along each of the lines, with boundary conditions for each edge provided at the adjacent vertices ensuring that the current added over all edges adds to zero at each vertex.

Quantum graphs were first studied by Linus Pauling as models of free electrons in organic molecules in the 1930s. They also arise in a variety of mathematical contexts,^[1] e.g. as model systems in quantum chaos, in the study of waveguides, in photonic crystals and in Anderson localization, or as limit on shrinking thin wires. Quantum graphs have become prominent models in mesoscopic physics used to obtain a theoretical understanding of nanotechnology. Another, more simple notion of quantum graphs was introduced by Freedman et al.^[2]

Aside from actually solving the differential equations posed on a quantum graph for purposes of concrete applications, typical questions that arise are those of controllability (what inputs have to be provided to bring the system into a desired state, for example providing sufficient power to all houses on a power network) and identifiability (how and where one has to measure something to obtain a complete picture of the state of the system, for example measuring the pressure of a water pipe network to determine whether or not there is a leaking pipe).

Metric graphs

A metric graphis a graph consisting of a set

V of vertices and a set E of edges where each edge e = (v _{1,v} _{2)\in} E has been associated with an interval [ 0 ,L _{e]} so that x _{e} is the coordinate on the interval, the vertex v _{1} corresponds to x _{e=0} and v _{2} to x _{e=L} _{e} or vice versa. The choice of which vertex lies at zero is arbitrary with the alternative corresponding to a change of coordinate on the edge.The graph has a natural metric: for two points x,y on the graph, \rho(x,y) is the shortest distance between themwhere distance is measured along the edges of the graph.

Open graphs: in the combinatorial graph model edges always join pairs of vertices however in a quantum graph one may also consider semi-infinite edges. These are edges associated with the interval

[ 0 , inf ty) attached to a single vertex at x _{e=0} . A graph with one or more such open edges is referred to as an open graph.

Quantum graphs

Quantum graphs are metric graphs equipped with a differential (or pseudo-differential) operator acting on functions on the graph. A function

f on a metric graph is defined as the |E| -tuple of functionsf _{e(x} _{e)} on the intervals. The Hilbert space of the graph is o plus _{e\in} L ^{2 ([ 0 ,L} _{e])} where the inner product of two functions is\langle f,g \rangle = \sum _{e\in} \int ^{L _{e}} _{0} f ^{*} _{e} (x _{e)g} _{e(x} _{e)} dx _{e,} L _{e} may be infinite in the case of an open edge. The simplest example of an operator on a metric graph is the Laplace operator. The operator on an edge is - (rm{d)/(^{2}{rm{d}x}) ^{2 }} ^{e} where x _{e} is the coordinate on the edge. To make the operator self-adjoint a suitable domain must be specified. This is typically achieved by taking the Sobolev space H ^{2} of functions on the edges of the graph and specifying matching conditions at the vertices.

The trivial example of matching conditions that make the operator self-adjoint are the Dirichlet boundary conditions,

f _{e(0)=f} _{e(L} _{e)=0} for every edge. An eigenfunction on a finite edge may be written asf _{e(x} _{e)} = \sin \left( (n \pi x _{e})/(L _{e}) \right)

for integer

n . If the graph is closed with no infinite edges and the lengths of the edges of the graph are rationally independentthen an eigenfunction is supported on a single graph edge and the eigenvalues are (n ^{2\pi} ^{2})/(L ^{2} _{e}) . The Dirichlet conditions don't allow interaction between the intervals so the spectrum is the same as that of the set of disconnected edges.

More interesting self-adjoint matching conditions that allow interaction between edges are the Neumann or natural matching conditions. A function

f in the domain of the operator is continuous everywhere on the graph and the sum of the outgoing derivatives at a vertex is zero,\sum _{e\sim} f'(v) = 0 ,

where

f'(v) = f'( 0 ) if the vertex v is at x =0 and f'(v) =- f'(L _{e)} if v is at x = L _{e} .

The properties of other operators on metric graphs have also been studied.

• These include the more general class of Schrödinger operators,

\left( i (rm{d)/() } + A_e(x_e) \right)^2 + V_e(x_e) \,

where

A _{e} is a "magnetic vector potential" on the edge and V _{e} is a scalar potential.

• Another example is the Dirac operator on a graph which is a matrix valued operator acting on vector valued functions that describe the quantum mechanics of particles with an intrinsic angular momentum of one half such as the electron.
• The Dirichlet-to-Neumann operator on a graph is a pseudo-differential operator that arises in the study of photonic crystals.

Theorems

All self-adjoint matching conditions of the Laplace operator on a graph can be classified according to a scheme of Kostrykin and Schrader. In practice, it is often more convenient to adopt a formalism introduced by Kuchment, see,^[3] which automatically yields an operator in variational form.

Let

v be a vertex with d edges emanating from it. For simplicity we choose the coordinates on the edges so that v lies at x _{e=0} for each edge meeting at v . For a function f on the graph letf = (f _{e _{1}} ( 0 ),f _{e _{2}} ( 0 ), ... ,f _{e _{d}} ( 0 )) ^{T} , f ' = (f' _{e _{1}} ( 0 ),f' _{e _{2}} ( 0 ), ... ,f' _{e _{d}} ( 0 )) ^{T.} Matching conditions at v can be specified by a pair of matrices A and B through the linear equation,A f + B f ' = 0 .

The matching conditions define a self-adjoint operator if

(A, B) has the maximal rank d and AB ^{*} = BA ^{*} .

The spectrum of the Laplace operator on a finite graph can be conveniently described using a scattering matrix approach introduced by Kottos and Smilansky.^{[4] [5]} The eigenvalue problem on an edge is,

- (d ^{2})/(dx ^{2} _{e}) f _{e(x} ^{2} ^{e) = k} f _{e(x} _{e).}

So a solution on the edge can be written as a linear combination of plane waves.

f _{e(x} _{e)} = c _{e} rm{e} ^{i k x _{e}} + \hat{c} _{e} rm{e} ^{- i k x _{e}} .

where in a time-dependent Schrödinger equation

c is the coefficient of the outgoing plane wave at 0 and \hat{c} coefficient of the incoming plane wave at 0 .The matching conditions at v define a scattering matrixS(k) =- (A + i kB) ^{-1} (A - ikB).

The scattering matrix relates the vectors of incoming and outgoing plane-wave coefficients at

v , c = S(k)\hat{ c }.For self-adjoint matching conditions S is unitary. An element of \sigma _{(uv)(vw)} of S is a complex transition amplitude from a directed edge (uv) to the edge (vw) which in general depends on k . However, for a large class of matching conditions the S-matrix is independent of k . With Neumann matching conditions for exampleA = \left( \begin{array}{ccccc} 1 & -1 & 0 & 0 & ... \\ 0 & 1 & -1 & 0 & ... \\ & & \ddots & \ddots & \\ 0 & ... & 0 & 1 & -1 \\ 0 & ... & 0 & 0 & 0 \\ \end{array} \right) , B = \left( \begin{array}{cccc} 0 & 0 & ... & 0 \\ \vdots & \vdots & & \vdots \\ 0 & 0 & ... & 0 \\ 1 & 1 & ... & 1 \\ \end{array} \right).

Substituting in the equation for

S produces k -independent transition amplitudes\sigma _{(uv)(vw)} = (2)/(d) - \delta _{uw} .

where

\delta _{uw} is the Kronecker delta function that is one if u = w and zero otherwise. From the transition amplitudes we may define a 2 |E| x 2 |E| matrixU _{(uv)(lm)} (k) = \delta _{vl} \sigma _{(uv)(vm)} (k) rm{e} ^{i kL _{(uv)}} . U is called the bond scattering matrix and can be thought of as a quantum evolution operator on the graph. It isunitary and acts on the vector of 2 |E| plane-wave coefficients for the graph where c _{(uv)} is the coefficient of the plane wave traveling from u to v . The phase rm{e} ^{i kL _{(uv)}} is the phase acquired by the plane wave when propagating from vertex u to vertex v .

Quantization condition: An eigenfunction on the graph can be defined through its associated

2 |E| plane-wave coefficients.As the eigenfunction is stationary under the quantum evolution a quantization condition for the graph can be written using the evolution operator.|U(k) - I| =0 .

Eigenvalues

k _{j} occur at values of k where the matrix U(k) has an eigenvalue one. We will order the spectrum with 0 \leqslant k _{0} \leqslant k _{1} \leqslant ... .

The first trace formula for a graph was derived by Roth (1983).In 1997 Kottos and Smilansky used the quantization condition above to obtainthe following trace formula for the Laplace operator on a graph when thetransition amplitudes are independent of

k .The trace formula links the spectrum with periodic orbits on the graph.d(k): = \sum ^{inf ty} _{j =0} \delta(k - k _{j) = (L)/(\pi)} + (1)/(\pi) \sum _{p} (L _{p})/(r _{p}) A _{p} \cos(kL _{p).} d(k) is called the density of states. The right hand side of the trace formula is made up of two terms, the Weyl term (L)/(\pi) is the mean separation of eigenvalues and the oscillating part is a sum over all periodic orbits p = (e _{1,e} _{2,...,e} _{n)} on the graph. L _{p=\sum} _{e\in} L _{e} is the length of the orbit and L = \sum _{e\in} L _{e} isthe total length of the graph. For an orbit generated by repeating a shorter primitive orbit, r _{p} counts the number of repartitions. A _{p=\sigma} ^{e _{1} e _{2}} \sigma _{e _{2} e _{3}} ... \sigma _{e _{n} e _{1}} is the product of the transition amplitudes at the vertices of the graph around the orbit.

Applications

Quantum graphs were first employed in the 1930s to model the spectrum of free electrons in organic molecules like Naphthalene, see figure. As a first approximation the atoms are taken to be vertices while the σ-electrons form bonds that fix a framein the shape of the molecule on which the free electrons are confined.

A similar problem appears when considering quantum waveguides. These are mesoscopic systems - systems built with a width on the scale ofnanometers. A quantum waveguide can be thought of as a fattened graph where the edgesare thin tubes. The spectrum of the Laplace operator on this domainconverges to the spectrum of the Laplace operator on the graphunder certain conditions. Understanding mesoscopic systems plays an important role in the field of nanotechnology.

In 1997^[6] Kottos and Smilansky proposed quantum graphs as a model to study quantum chaos, the quantum mechanics of systems that are classically chaotic. Classical motion on the graph can be defined as a probabilistic Markov chain where the probability of scattering from edge

e to edge f is given by the absolute value of the quantum transition amplitude squared, |\sigma _{ef} | ^{2} . For almost all finite connected quantum graphs the probabilistic dynamics is ergodic and mixing, in other words chaotic.

Quantum graphs embedded in two or three dimensions appear in the studyof photonic crystals.^[7] In two dimensions a simple model of a photonic crystal consists of polygonal cells of a dense dielectric with narrow interfaces between the cells filled with air. Studying dielectric modes that stay mostly in the dielectric gives rise to a pseudo-differential operator on the graph that follows the narrow interfaces.

Periodic quantum graphs like the lattice in

{ R} ^{2} are common models ofperiodic systems and quantum graphs have been applied to the study the phenomena of Anderson localization where localized states occur at the edge of spectral bands in the presence of disorder.

See also

• Schild's Ladder, a novel dealing with a fictional quantum graph theory
• Feynman diagram

References

1. Book: Berkolaiko. Gregory. Carlson. Robert. Kuchment. Peter. Fulling. Stephen. Quantum Graphs and Their Applications (Contemporary Mathematics): Proceedings of an AMS-IMS-SIAM Joint Summer Research Conference on Quantum Graphs and Their Applications. 415. 2006. 978-0821837658. American Mathematical Society.
2. Freedman. Michael. Lovász. László. Schrijver. Alexander. Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society. 20. 1. 2007. 37–52. 0894-0347. 10.1090/S0894-0347-06-00529-7. 2257396. math/0404468. 2007JAMS...20...37F . 8208923 .
3. Kuchment. Peter. Quantum graphs: I. Some basic structures. Waves in Random Media. 14. 1. 2004. S107–S128. 0959-7174. 10.1088/0959-7174/14/1/014. 2004WRM....14S.107K . 16874849 .
4. Kottos. Tsampikos. Smilansky. Uzy. Periodic Orbit Theory and Spectral Statistics for Quantum Graphs. Annals of Physics. 274. 1. 1999. 76–124. 0003-4916. 10.1006/aphy.1999.5904 . chao-dyn/9812005. 1999AnPhy.274...76K . 17510999 .
5. Gnutzmann∥. Sven. Smilansky. Uzy. Quantum graphs: Applications to quantum chaos and universal spectral statistics. Advances in Physics. 55. 5–6. 2006. 527–625. 0001-8732. 10.1080/00018730600908042. nlin/0605028. 2006AdPhy..55..527G . 119424306 .
6. Kottos. Tsampikos. Smilansky. Uzy. Quantum Chaos on Graphs. Physical Review Letters. 79. 24. 1997. 4794–4797. 0031-9007. 10.1103/PhysRevLett.79.4794. 1997PhRvL..79.4794K .
7. Kuchment. Peter. Kunyansky. Leonid. Differential Operators on Graphs and Photonic Crystals. Advances in Computational Mathematics. 16. 24. 2002. 263–290. 10.1023/A:1014481629504. 17506556 .