Quantum algorithms offer an exponential advantage with respect to the number of dependent variables for solving certain nonlinear ordinary differential equations (ODEs). These algorithms typically begin by transforming the original nonlinear ODE into a higher-dimensional linear ODE using a linearization technique, most commonly Carleman linearization. Existing works restrict their analysis to ODEs where the nonlinearities are polynomial functions of the dependent variables, significantly limiting their applicability. In this work we construct an efficient quantum algorithm for solving ODEs with `Fourier' nonlinear terms expressible as
du/dt=G0+G1eiu, where
u denotes a vector of
n complex variables evolving with
t,
G0 is an
n-dimensional complex vector,
G1 is an
n×n complex matrix and
eiu denotes the vector with entries
{eiuj}. To tackle the Fourier nonlinear term, which is not expressible as a finite sum of polynomials of
u, our algorithm employs a generalization of the Carleman linearization technique known as Koopman linearization. We also make other methodological advances towards relaxing the stringent dissipativity condition required for efficient solution extraction and towards integrated readout of classical quantities from the solution state. Our results open avenues to the development of efficient quantum algorithms for a significantly wider class of high-dimensional nonlinear ODEs, thereby broadening the scope of their applications.
Abstract While quantum computing provides an exponential advantage in solving linear differential equations, there are relatively few quantum algorithms for solving nonlinear differential equations. In our work, based on the homotopy perturbation method, we propose a quantum algorithm for solving n -dimensional nonlinear dissipative ordinary differential equations (ODEs). Our algorithm first converts the original nonlinear ODEs into the other nonlinear ODEs which can be embedded into finite-dimensional linear ODEs. Then we solve the embedded linear ODEs with quantum linear ODEs algorithm and obtain a state ϵ -close to the normalized exact solution of the original nonlinear ODEs with success probability Ω(1). The complexity of our algorithm is O ( gηT poly(log( nT / ϵ ))), where η , g measure the decay of the solution. Our algorithm provides exponential improvement over the best classical algorithms or previous quantum algorithms in n or ϵ .