University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Quantum algorithms for computing observables of nonlinear partial differential equations

Quantum algorithms for computing observables of nonlinear partial differential equations

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

FKTW05 - Frontiers in numerical analysis of kinetic equations

Nonlinear partial differential equations (PDEs) are crucial to modelling important problems in science but they are computationally expensive and suffer from the curse of dimensionality. Since quantum algorithms have the potential to resolve the curse of dimensionality in certain instances, some quantum algorithms for nonlinear PDEs have been developed. However, they are fundamentally bound either to weak nonlinearities, valid to only short times, or display no quantum advantage. We construct new quantum algorithms—based on level sets—for nonlinear Hamilton-Jacobi and scalar hyperbolic PDEs that can be performed with quantum advantages on various critical numerical parameters, even for computing the physical observables, for arbitrary nonlinearity and are valid globally in time.  These PDEs are important for many applications like optimal control, machine learning, semi-classical limit of Schrodinger equations, mean-field games and many more. Depending on the details of the initial data, it can  display up to exponential advantage in both the dimension of the PDE and the error in computing its observables.  For general nonlinear PDEs, quantum advantage with respect to $M$, for computing the ensemble averages of solutions corresponding to $M$ different initial data, is possible in the large $M$ limit.This is a joint work with Nana Liu.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity