Quantum graph

Quantum graph

In mathematics and physics, a quantum graph is a linear, network-shaped structure whose time evolution is described by a system of schrödinger equations or, more generally, by a set of evolution equations associated with differential or pseudo-differential operators acting on functions defined on a metric graph. Such systems were first studied by Ruedenberg--Scherr as models of free electrons in organic molecules in the 1950s. They arise in a variety of mathematical contexts, 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.

Metric graphs

400px|right|thumb|A metric graph embedded in the plane with three open edges. The dashed line denotes the metric distance between two points ">x and y.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, ho(x,y) is the shortest distance between themwhere distance is measured along the edges of the graph.It is possible to embed a metric graph in the plane, {mathbb R}^2, or space, {mathbb R}^3, if the lengths are chosen appropriately.

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,infty) 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 igoplus_{ein E} L^2( [0,L_e] )where the inner product of two functions is

:langle f,g angle = sum_{ein E} int_{0}^{L_e} 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 -frac{ extrm{d}^2}{ extrm{d} x_e^2} 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 as

:f_e(x_e) = sin left( frac{n pi x_e}{L_e} ight)

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 frac{n^2pi^2}{L_e^2}. 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_{esim v} 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 frac{ extrm{d{ extrm{d} x_e} + A_e(x_e) ight)^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, see P. Kuchment, Quantum graphs I. Some basic structures, "Waves in Random Media" 14, S107-S128 (2004)] . 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 let

:mathbf{f}=(f_{e_1}(0),f_{e_2}(0),dots,f_{e_{d(0))^T , qquad mathbf{f}'=(f'_{e_1}(0),f'_{e_2}(0),dots,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 mathbf{f} +B mathbf{f}'=mathbf{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 SmilanskyS. Gnutzman & U. Smilansky, Quantum graphs: applications to quantum chaos and universal spectral statistics, "Adv. Phys." 55 527-625 (2006)] . The eigenvalue problem on an edge is,

:-frac{d^2}{dx_e^2} f_e(x_e)=k^2 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 extrm{e}^{i k x_e} + hat{c}_e extrm{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 matrix

:S(k)=-(A+i kB)^{-1}(A-ikB).,

The scattering matrix relates the vectors of incoming and outgoing plane-wave coefficients at v, mathbf{c}=S(k)hat{mathbf{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 example

:A=left( egin{array}{ccccc}1& -1 & 0 & 0 & dots \\0 & 1 & -1 & 0 & dots \\& & ddots & ddots & \\0& dots & 0 & 1 & -1 \\0 &dots & 0 & 0& 0 \\end{array} ight) , quad B=left( egin{array}{cccc}0& 0 & dots & 0 \\vdots & vdots & & vdots \\0& 0 & dots & 0 \\1 &1 & dots & 1 \\end{array} ight).

Substituting in the equation for S produces k-independent transition amplitudes

:sigma_{(uv)(vw)}=frac{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| imes 2|E| matrix

:U_{(uv)(lm)}(k)= delta_{vl} sigma_{(uv)(vm)}(k) extrm{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 extrm{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 its 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 0leqslant k_0 leqslant k_1 leqslant dots.

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_{j=0}^{infty} delta(k-k_j)=frac{L}{pi}+frac{1}{pi} sum_p frac{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 frac{L}{pi} is the mean separation of eigenvalues and the oscillating part is a sum over all periodic orbits p=(e_1,e_2,dots,e_n) on the graph. L_p=sum_{ein p} L_e is the length of the orbit and L=sum_{ein E}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} dots 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 1930's 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 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. 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 {mathbb 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.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • quantum mechanics — quantum mechanical, adj. Physics. a theory of the mechanics of atoms, molecules, and other physical systems that are subject to the uncertainty principle. Abbr.: QM Cf. nonrelativistic quantum mechanics, relativistic quantum mechanics. [1920 25]… …   Universalium

  • Quantum group — In mathematics and theoretical physics, quantum groups are certain noncommutative algebras that first appeared in the theory of quantum integrable systems, and which were then formalized by Vladimir Drinfel d and Michio Jimbo. There is no single …   Wikipedia

  • Graph states — In quantum computing, is special type of multi qubit state that can be represented by a graph. Each qubit is represented by a vertex of the graph, and there is an edge between every interacting pair of qubits. In particular, they are a convenient …   Wikipedia

  • graph state — noun Any of a class of multipartite entangled quantum states that can be interpreted using the mathematics of graph theory …   Wiktionary

  • Delayed choice quantum eraser — Quantum mechanics Uncertainty principle …   Wikipedia

  • Continuous-time quantum walk — A Continuous time quantum walk (CTQW) is a walk on a given connected graph that is dictated by a time varying unitary matrix that relies on the Hamiltonian of the quantum system and the adjacency matrix. CTQW belongs to what is known as Quantum… …   Wikipedia

  • Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… …   Wikipedia

  • Loop quantum gravity — Not to be confused with the path integral formulation of LQG, see spin foam. This article is about LQG in its Canonical formulation.. Beyond the Standard Model …   Wikipedia

  • One-way quantum computer — The one way or measurement based quantum computer is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is one way because the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”