Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations.

We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations (ODEs) and nonlinear Hamilton-Jacobi equations (HJE) via linear representations or exact mappings between nonlinear ODEs/HJE and linear partial differential equations (the Liouville equation and the Koopman-von Neumann equation). The connection between the linear representations and the original nonlinear system is established through the Dirac delta function or the level set mechanism. We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations, including the finite difference discretisations and the Fourier spectral discretisations for the two different linear representations, with the result showing that the quantum simulation methods usually give the best performance in time complexity. We also propose the Schrödinger framework to solve the Liouville equation for the HJE with the Hamiltonian formulation of classical mechanics, since it can be recast as the semiclassical limit of the Wigner transform of the Schrödinger equation. Comparison between the Schrödinger and the Liouville framework will also be made. • A (and the first) comprehensive study and comparison of time complexities between two linear representations-based quantum algorithms for nonlinear ODEs. • For nonlinear Hamilton-Jacobi PDEs, a Schrödinger approach is introduced and compared with the Liouville approach. • For scalar nonlinear hyperbolic equations, we show the difficulty of using the KvN approach while the Liouville approach still works. [ABSTRACT FROM AUTHOR]