Efficient quantum algorithm for dissipative nonlinear differential equations

  title={Efficient quantum algorithm for dissipative nonlinear differential equations},
  author={Jin-Peng Liu and Herman Oie Kolden and Hari Krovi and Nuno F. Loureiro and Konstantina Trivisa and Andrew M. Childs},
  journal={Proceedings of the National Academy of Sciences},
Significance Nonlinear differential equations appear in many domains and are notoriously difficult to solve. Whereas previous quantum algorithms for general nonlinear differential equations have complexity exponential in the evolution time, we give the first quantum algorithm for dissipative nonlinear differential equations that is efficient provided the dissipation is sufficiently strong relative to nonlinear and forcing terms and the solution does not decay too rapidly. We also establish a… 

Figures from this paper

A quantum-inspired approach to exploit turbulence structures

Understanding turbulence is the key to our comprehension of many natural and technological flow processes. At the heart of this phenomenon lies its intricate multi-scale nature, describing the

Variational quantum solutions to the advection–diffusion equation for applications in fluid dynamics

This hybrid quantum–classical method, which combines several algorithms, scales logarithmically with the dimension of the vector space and quadratically with the number of nonzero terms in the linear combination of unitary operators that specifies the linear operator describing the system of interest.

Quantum computing for software engineering: prospects

Eight groups of quantum algorithms that may accelerate Software Engineering (SE) tasks across the different phases of SE and sketch potential opportunities and challenges are examined.

Koopman von Neumann mechanics and the Koopman representation: A perspective on solving nonlinear dynamical systems with quantum computers

This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and calculating the discrete-time components of the response of the immune system.

Analysis of Carlemann Linearization of Lattice Boltzmann

The error arising from Carlemann linearization has been shown analytically and numerically to improve exponentially with the Carlemania linearization order, which bodes well for the development of a corresponding quantum computing algorithm based on the Lattice Boltzmann equation.

Reachability of weakly nonlinear systems using Carleman linearization

A solution method for a special class of nonlinear initial-value problems using set-based propagation techniques using Carleman linearization to leverage recent advances of highdimensional reachability solvers for linear ordinary differential equations based on the support function.

Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation

This work improves upon the Carleman linearization approach introduced in [1] to obtain a faster convergence rate under the condition R D < 1, where R D measures the ratio of nonlinearity to dissipation using the (cid:96) ∞ norm.

Improved quantum algorithms for linear and nonlinear differential equations

  • H. Krovi
  • Computer Science, Mathematics
  • 2022
The present quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices and can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non- diagonalizableMatrices), whereas [2] and [3] additionally require normality.

Quantum Algorithms for Solving Ordinary Differential Equations via Classical Integration Methods

It is found that the quantum annealing approach exhibits the largest potential for high-order implicit integration methods, and could be employed as an "oracle" within quantum search algorithms for inverse problems.

Time complexity analysis of quantum difference methods for the multiscale transport equations

It is found that the time complexities of both the classical treatment and quantum treatment for a standard explicit scheme scale as O (1 /ε ), where ε is the small scaling parameter, while the complexities for the even-odd parity based Asymptotic-Preserving (AP) scheme do not depend on ε.



Explicit Error Bounds for Carleman Linearization

This paper revisits the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides and proposes two strategies to obtain a time-dependent function that locally bounds the truncation error.

Quantum algorithms for solving linear differential equations

This work extends quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems, and examines the use of high-order methods to improve the efficiency.

A quantum algorithm to solve nonlinear differential equations

A quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials and its expected resource requirements are polylogarithmic in the number of variables and exponential in the integration time.

Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision

This work presents a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients that produces a quantum state that is proportional to the solution at a desired final time using a Taylor series.

Quantum vs. Classical Algorithms for Solving the Heat Equation

It is found that, for spatial dimension $d \ge 2$, there is an at most quadratic quantum speedup using an approach based on applying amplitude estimation to an accelerated classical random walk.

An introduction to numerical analysis

This paper presentsError: Its Sources, Propagation, and Analysis, as well as answers to Selected Problems.

Hyberbolic Conservation Laws in Continuum Physics

This is a masterly exposition and an encyclopedic presentation of the theory of hyperbolic conservation laws. It illustrates the essential role of continuum thermodynamics in providing motivation and

Competition models in population biology

The chemostat: Interacting populations The Lotka-Volterra competition model Competition in the che mostat A three-level food chain Bifurcation from a limit cycle Two predators competing for a renewable resource Two predators feeding on a prey growing in a chemostats.

Quantum algorithms and the finite element method

The quantum algorithm can achieve a polynomial speedup, the extent of which grows with the dimension of the partial differential equation, and there is evidence that no improvement of the quantum algorithm could lead to a super-polynomial speedup when the dimension is fixed and the solution satisfies certain smoothness properties.