A discrete Schrodinger equation via optimal transport on graphs

Abstract

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.

References in corpus (1)

• The Discrete Nonlinear Schrödinger equation - 20 Years on

Cited by in corpus (8)

• Fisher information regularization schemes for Wasserstein gradient flows
• Transport information geometry I: Riemannian calculus on probability simplex
• Ricci curvature for parametric statistics via optimal transport
• Schrödinger Approach to Optimal Control of Large-Size Populations
• Geodesic of minimal length in the set of probability measures on graphs
• Algorithm for Hamilton-Jacobi equations in density space via a generalized Hopf formula
• Hopf-Cole transformation via generalized Schrödinger bridge problem
• Natural gradient via optimal transport