Efficient Quantum Algorithm for Nonlinear Reaction–Diffusion Equations and Energy Estimation

Nonlinear differential equations exhibit rich phenomena in many fields but are notoriously challenging to solve. Recently, Liu et al. (in: Proceedings of the National Academy of Sciences 118(35), 2021) demonstrated the first efficient quantum algorithm for dissipative quadratic differential equations under the condition R< 1 , where R measures the ratio of nonlinearity to dissipation using the ℓ2 norm. Here we develop an efficient quantum algorithm based on Liu et al. (2021) for reaction–diffusion equations, a class of nonlinear partial differential equations (PDEs). To achieve this, we improve upon the Carleman linearization approach introduced in Liu et al. (2021) to obtain a faster convergence rate under the condition RD< 1 , where RD measures the ratio of nonlinearity to dissipation using the ℓ∞ norm. Since RD is independent of the number of spatial grid points n while R increases with n, the criterion RD< 1 is significantly milder than R< 1 for high-dimensional systems and can stay convergent under grid refinement for approximating PDEs. As applications of our quantum algorithm we consider the Fisher-KPP and Allen-Cahn equations, which have interpretations in classical physics. In particular, we show how to estimate the mean square kinetic energy in the solution by postprocessing the quantum state that encodes it to extract derivative information.

Duke Scholars

Author Di Fang Mathematics