A Quantum Algorithm for Nonlinear Electromagnetic Fluid Dynamics via Koopman-von Neumann Linearization
Hayato Higuchi, Yuki Ito, Kazuki Sakamoto, Keisuke Fujii, Akimasa Yoshikawa
TL;DR
The paper tackles the computational bottlenecks of nonlinear plasma simulations by mapping electromagnetic fluid dynamics to a linear quantum dynamics via Koopman‑von Neumann (KvN) linearization and solving it with quantum singular value transformation (QSVT). The KvN framework yields a sparse, truncated Hamiltonian that can be simulated on a quantum computer with polylogarithmic dependence on grid points and exponential savings in spatial dimension, achieving a polynomial speedup in the number of grid points per dimension and an exponential advantage in the number of spatial dimensions. Numerical experiments, including 1D linear oscillations, 1D nonlinear advection, and 2D Kelvin–Helmholtz instability, demonstrate accurate behavior and reveal practical guidelines for truncation parameters $m$ and $R$ in real‑world problems. The results indicate that quantum computing can provide a viable pathway to overcome multiscale bottlenecks in nonlinear plasma modeling, with potential scalability to large‑scale simulations given adequate quantum resources.
Abstract
To simulate plasma phenomena, large-scale computational resources have been employed in developing high-precision and high-resolution plasma simulations. One of the main obstacles in plasma simulations is the requirement of computational resources that scale polynomially with the number of spatial grids, which poses a significant challenge for large-scale modeling. To address this issue, this study presents a quantum algorithm for simulating the nonlinear electromagnetic fluid dynamics that govern space plasmas. We map it, by applying Koopman-von Neumann linearization, to the Schrödinger equation and evolve the system using Hamiltonian simulation via quantum singular value transformation. Our algorithm scales $O \left(s N_x \, \mathrm{polylog} \left( N_x \right) T \right)$ in time complexity with $s$, $N_x$, and $T$ being the spatial dimension, the number of spatial grid points per dimension, and the evolution time, respectively. Comparing the scaling $O \left( s N_x^s \left(T^{5/4}+T N_x\right) \right)$ for the classical method with the finite volume scheme, this algorithm achieves polynomial speedup in $N_x$. The space complexity of this algorithm is exponentially reduced from $O\left( s N_x^s \right)$ to $O\left( s \, \mathrm{polylog} \left( N_x \right) \right)$. Numerical experiments validate that accurate solutions are attainable with smaller $m$ than theoretically anticipated and with practical values of $m$ and $R$, underscoring the feasibility of the approach. As a practical demonstration, the method accurately reproduces the Kelvin-Helmholtz instability, underscoring its capability to tackle more intricate nonlinear dynamics. These results suggest that quantum computing can offer a viable pathway to overcome the computational barriers of multiscale plasma modeling.
