English

Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms

Plasma Physics 2021-06-14 v2 Quantum Physics

Abstract

The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously-studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.

Keywords

Cite

@article{arxiv.2012.06681,
  title  = {Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms},
  author = {Alexander Engel and Graeme Smith and Scott E. Parker},
  journal= {arXiv preprint arXiv:2012.06681},
  year   = {2021}
}

Comments

13 pages

R2 v1 2026-06-23T20:54:57.377Z