An efficient quantum algorithm for simulating polynomial differential equations

by   Amit Surana, et al.

We present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary degree on quantum platforms. Models of physical systems that are governed by ordinary differential equations (ODEs) or partial differential equation (PDEs) can be challenging to solve on classical computers due to high dimensionality, stiffness, nonlinearities, and sensitive dependence to initial conditions. For sparse n-dimensional linear ODEs, quantum algorithms have been developed which can produce a quantum state proportional to the solution in poly(log(nx)) 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, prove polynomial scaling of runtime on k and demonstrate the framework on an example.


page 1

page 2

page 3

page 4


Efficient quantum algorithm for dissipative nonlinear differential equations

While there has been extensive previous work on efficient quantum algori...

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a sy...

Exact and optimal quadratization of nonlinear finite-dimensional non-autonomous dynamical systems

Quadratization of polynomial and nonpolynomial systems of ordinary diffe...

An Efficient Method for Computing Liouvillian First Integrals of Planar Polynomial Vector Fields

Here we present an efficient method to compute Darboux polynomials for p...

Gibbs Sampling of Periodic Potentials on a Quantum Computer

Motivated by applications in machine learning, we present a quantum algo...

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms ove...

Time-marching based quantum solvers for time-dependent linear differential equations

The time-marching strategy, which propagates the solution from one time ...

Please sign up or login with your details

Forgot password? Click here to reset