An efficient quantum algorithm for simulating polynomial dynamical systems

Abstract

In this paper, we present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary (finite) degree on quantum platforms. Ordinary differential equations (ODEs) and partial differential equations (PDEs) arise extensively in science and engineering applications. Examples of ODE models include mechanics of rigid bodies, molecular dynamics, chemical kinetics, and epidemiology. Nonlinear PDEs arise in fluid dynamics, combustion, weather forecasting, structural mechanics, plasma dynamics, and finance to name a few. In practice, it is challenging to simulate such equations on classical computers due to high dimensionality, stiffness arising from multiple spatial/temporal scales, nonlinearities, and chaotic dynamics. Typically, high performance computing is used to mitigate computational challenges and involves approximations for tractability. For sparse n-dimensional linear ODEs, quantum algorithms have been developed which can produce a quantum state proportional to the solution in 𝑝𝑜𝑙𝑦(log⁡(𝑛))) time using the quantum linear systems algorithm (QLSA). Recently, this framework was extended to systems of nonlinear ODEs with quadratic polynomial vector fields by applying Carleman linearization that enables the embedding of the quadratic system into an approximate linear form. A detailed complexity analysis was conducted which showed significant computational advantage under certain conditions. We present an extension of this algorithm to deal with systems of nonlinear ODEs with k-th degree polynomial vector fields for arbitrary (finite) values of k. The steps involve: (1) mapping the k-th degree polynomial ODE to a higher-dimensional quadratic polynomial ODE; (2) applying Carleman linearization to transform the quadratic ODE to an infinite-dimensional system of linear ODEs; (3) truncating and discretizing the linear ODE and solving using the forward Euler method and QLSA. Alternatively, one could apply Carleman linearization directly to the k-th degree polynomial ODE, resulting in a system of infinite-dimensional linear ODEs, and then apply step 3. This solution route can be computationally more efficient. We present detailed complexity analysis of the proposed algorithms and prove polynomial scaling of runtime on k. We demonstrate the computational framework on a numerical example.