English

Quantum Algorithm for the Vlasov Equation

Quantum Physics 2019-12-19 v2 Plasma Physics

Abstract

The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution function, we convert the Vlasov-Maxwell system into a Hamiltonian simulation problem. Then for the limiting case of electrostatic Landau damping, we design and verify a quantum algorithm, appropriate for a future error-corrected universal quantum computer. While the classical simulation has costs that scale as O(Nvt)\mathcal{O}(N_v t) for a velocity grid with NvN_v grid points and simulation time tt, our quantum algorithm scales as O(polylog(Nv)t/δ)\mathcal{O}(\text{polylog}(N_v) t/\delta) where δ\delta is the measurement error, and weaker scalings have been dropped. Extensions, including electromagnetics and higher dimensions, are discussed. A quantum computer could efficiently handle a high-resolution, six-dimensional phase-space grid, but the 1/δ1/\delta cost factor to extract an accurate result remains a difficulty. This paper provides insight into the possibility of someday achieving efficient plasma simulation on a quantum computer.

Keywords

Cite

@article{arxiv.1907.09418,
  title  = {Quantum Algorithm for the Vlasov Equation},
  author = {Alexander Engel and Graeme Smith and Scott E. Parker},
  journal= {arXiv preprint arXiv:1907.09418},
  year   = {2019}
}

Comments

10 pages, 8 figures