A fast and accurate method for simulating Bragg atom interferometers
Jack Roth, Andrew Christensen, Madeline Bernstein, Yuno Iwasaki, Holger Mueller
TL;DR
This work tackles systematic effects in Bragg atom interferometers arising from finite momentum width by solving the 1D time-dependent Schrödinger equation for Bragg scattering. It introduces a fast reduction to decoupled ordinary differential equations in momentum space by exploiting the delta-function-like coupling of the sinusoidal Bragg potential, leading to discretized states $\phi_{n,s}=\phi(2\hbar k n+\hbar k s/S)$ and the evolution $i\hbar \dot{\phi}_{n,s} = \hbar \omega_{\mathrm{r}}(2n + s/S)^2 \phi_{n,s} + \hbar \frac{\Omega_{\mathrm{eff}}(t)}{8}[\phi_{n-1,s} e^{-i\delta t} + \phi_{n+1,s} e^{i\delta t} + 2\phi_{n,s}]$. The approach supports adaptive Runge–Kutta integration and can be augmented by a lookup table to accelerate repeated runs, enabling efficient simulation of long-baseline interferometers and realistic atomic clouds with parasitic momentum states. The results show that the method is faster and more accurate than standard position-space solvers for fixed-pulse Bragg dynamics, while noting that split-step remains more versatile for non-periodic potentials.
Abstract
Atom interferometers are used in a variety of applications, from measuring gravity and gravity gradients in the field to performing tests of fundamental physics in the lab. One method of increasing interferometer sensitivity is to produce a larger momentum difference between interferometer arms through the use of large momentum transfer methods, such as Bragg diffraction. However, Bragg diffraction introduces systematic effects in the accumulated interferometer phase that are challenging to characterize. A Bragg atom interferometer is described by the one-dimensional time-dependent Schrödinger equation (1D-TDSE). In this paper we show that for the case of Bragg diffraction the 1D-TDSE partial differential equation can be separated into several systems of ordinary differential equations, allowing for the use of adaptive step size Runge-Kutta methods. We compare the convergence of this method to the split-step and Crank-Nicolson methods, and present a method for further computational speed-ups using a lookup table.
