图上最优输运的离散薛定谔方程
A discrete Schrodinger equation via optimal transport on graphs
摘要:
1966年,爱德华·纳尔逊提出了一个有趣的推导薛定谔方程使用布朗运动。最近,这一推导与最优输运理论相联系,表明薛定谔方程是一个在概率密度流形上的哈密顿系统,并配备了Wasserstein度规。在本文中,我们考虑有限图上的类似问题。利用离散的最优输运及其相应的Nelson方法,导出了有限图上的离散薛定谔方程。所提出的系统是很大的不同于通常提到的离散薛定谔方程。它是一个非线性常微分方程(ODE)系统,具有许多理想的性质。几个数值例子来说明的性质。
英文摘要:
In 1966, Edward Nelson presented an interesting derivation of the Schrodinger equation using Brownian motion. Recently, this derivation is linked to the theory of optimal transport, which shows that the Schrodinger equation is a Hamiltonian system on the probability density manifold equipped with the Wasserstein metric. In this paper, we consider similar matters on a finite graph. By using discrete optimal transport and its corresponding Nelson's approach, we derive a discrete Schrodinger equation on a finite graph. The proposed system is quite different from the commonly referred discretized Schrodinger equations. It is a system of nonlinear ordinary differential equations (ODEs) with many desirable properties. Several numerical examples are presented to illustrate the properties.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。