arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.5359math-phcond-mat.mes-hallhep-thmath.MP
收藏

一般量子图散射矩阵的直接计算

Direct computation of scattering matrices for general quantum graphs

V. Caudrelier, E. Ragoucy

摘要:

给出了一种计算任意有限非紧连通量子图的总散射矩阵的直接而简单的方法,该量子图的度量结构和每个顶点的局部散射数据都是已知的.该方法的灵感来自于图上的反射-透射代数和量子场论的形式主义,尽管结果独立于这种形式主义。它产生了一个简单而直接的代数推导公式的总散射,并有一些优点相比,现有的递归方法。循环(或蝌蚪)的情况很容易纳入我们的方法。这提供了一个扩展最近获得的类似结果在一个完全不同的方式在抽象图论的背景下。它还允许我们简要地讨论逆散射问题中存在的循环使用一个明确的例子来表明,解决方案是不唯一的一般。在概念上非常容易的顶部,该方法的计算优势的两个例子的“三维”图形(四面体和立方体),其他方法是相当沉重,甚至不切实际的。

英文摘要:

We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired by the formalism of Reflection-Transmission algebras and quantum field theory on graphs though the results hold independently of this formalism. It yields a simple and direct algebraic derivation of the formula for the total scattering and has a number of advantages compared to existing recursive methods. The case of loops (or tadpoles) is easily incorporated in our method. This provides an extension of recent similar results obtained in a completely different way in the context of abstract graph theory. It also allows us to discuss briefly the inverse scattering problem in the presence of loops using an explicit example to show that the solution is not unique in general. On top of being conceptually very easy, the computational advantage of the method is illustrated on two examples of "three-dimensional" graphs (tetrahedron and cube) for which other methods are rather heavy or even impractical.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑