From Vlasov-Poisson to Schrödinger-Poisson: Dark matter simulation with a quantum variational time evolution algorithm

Abstract

Cosmological simulations describing the evolution of density perturbations of a self-gravitating collisionless dark matter (DM) fluid in an expanding background provide a powerful tool to follow the formation of cosmic structures over wide dynamic ranges. The most widely adopted approach, based on the 𝑁-body discretization of the collisionless Vlasov-Poisson (VP) equations, is hampered by an unfavorable scaling when simulating the wide range of scales needed to cover at the same time the formation of single galaxies and of the largest cosmic structures. On the other hand, the dynamics described by the VP equations is limited by the rapid increase of the number of resolution elements (grid points and/or particles) which is required to simulate an ever growing range of scales. Recent studies showed an interesting mapping of the six-dimensional + 1 (6D+1) VP problem into a more amenable 3D+1 nonlinear Schrödinger-Poisson (SP) problem for simulating the evolution of DM perturbations. This opens up the possibility of improving the scaling of time propagation simulations using quantum computing. In this paper, we introduce a quantum algorithm for simulating the Schrödinger-Poisson (SP) equation by adapting a variational real-time evolution approach to a self-consistent, nonlinear, problem. To achieve this, we designed a novel set of quantum circuits that establish connections between the solution of the original Poisson equation and the solution of the corresponding time-dependent Schrödinger equation. We also analyzed how nonlinearity impacts the variance of observables. Furthermore, we explored how the spatial resolution behaves as the SP dynamics approaches the classical limit (ℏ/𝑚→0) and discovered an empirical logarithmic relationship between the required number of qubits and the scale of the SP equation (ℏ/𝑚). This entire approach holds the potential to serve as an efficient alternative for solving the Vlasov-Poisson (VP) equation by means of classical algorithms.