Quantized tensor networks for solving the Vlasov-Maxwell equations
read the original abstract
The Vlasov-Maxwell equations provide an \textit{ab-initio} description of collisionless plasmas, but solving them is often impractical because of the wide range of spatial and temporal scales that must be resolved and the high dimensionality of the problem. In this work, we present a quantum-inspired semi-implicit Vlasov-Maxwell solver that utilizes the quantized tensor network (QTN) framework. With this QTN solver, the cost of grid-based numerical simulation of size $N$ is reduced from $\mathcal{O}(N)$ to $\mathcal{O}(\text{poly}(D))$, where $D$ is the ``rank'' or ``bond dimension'' of the QTN and is typically set to be much smaller than $N$. We find that for the five-dimensional test problems considered here, a modest $D=64$ appears to be sufficient for capturing the expected physics despite the simulations using a total of $N=2^{36}$ grid points, \edit{which would require $D=2^{18}$ for full-rank calculations}. Additionally, we observe that a QTN time evolution scheme based on the Dirac-Frenkel variational principle allows one to use somewhat larger time steps than prescribed by the Courant-Friedrichs-Lewy (CFL) constraint. As such, this work demonstrates that the QTN format is a promising means of approximately solving the Vlasov-Maxwell equations with significantly reduced cost.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Quantum-Inspired Simulation of 2D Turbulent Rayleigh-B\'enard Convection
Matrix product state simulations of 2D Rayleigh-Bénard convection recover Nusselt number statistics with 1.8% error and a 9-fold reduction in degrees of freedom at Ra=10^10 using bond dimensions comparable to lower Ra cases.
-
Quantum-Inspired Tensor-Network Fractional-Step Method for Incompressible Flow in Curvilinear Coordinates
Tensor-network fractional-step method simulates incompressible flows in curvilinear coordinates with up to 20x field compression and 1000x operator compression while keeping errors below 0.3% versus finite differences.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.