Quantum simulation of a noisy classical nonlinear dynamics
Sergey Bravyi, Robert Manson-Sawko, Mykhaylo Zayats, Sergiy Zhuk
TL;DR
The paper develops an end-to-end quantum algorithm for simulating noisy, strongly nonlinear classical dynamics with quadratic drift by mapping the stochastic differential equation to a backward Kolmogorov equation and encoding its second-quantized form on a system of quantum harmonic oscillators. A regularization scheme reduces the infinite-dimensional problem to a finite subspace, enabling efficient sparse Hamiltonian simulation, while a readout strategy expresses the target observable as an inner product with a readout state that accounts for initial-condition noise. The authors prove polynomial-time, poly-logarithmic-in-N scaling (up to an exponential penalty in initialization error) and establish BQP-completeness for the problem, underscoring a quantum advantage for this class of nonlinear, dissipative, and noisy dynamics. They also illustrate applicability to fluid dynamics by benchmarking on a 2D Navier–Stokes vortex flow, highlighting potential impact on turbulent system simulations once fault-tolerant quantum hardware becomes available.
Abstract
We present an end-to-end quantum algorithm for simulating nonlinear dynamics described by a system of stochastic dissipative differential equations with a quadratic nonlinearity. The stochastic part of the system is modeled by a Gaussian noise in the equation of motion and in the initial conditions. Our algorithm can approximate the expected value of any correlation function that depends on $O(1)$ variables with rigorous bounds on the approximation error. The runtime scales polynomially with $\log{N}$, $t$, $J$, and $λ_1^{-1}$, where $N$ is the total number of variables, $t$ is the evolution time, $J$ is the nonlinearity strength, and $λ_1$ is the smallest dissipation rate. However, the runtime scales exponentially with a parameter quantifying inverse relative error in the initial conditions. To the best of our knowledge, this is the first rigorous quantum algorithm capable of simulating strongly nonlinear systems with $J\gg λ_1$ at the cost poly-logarithmic in $N$ and polynomial in $t$. The considered simulation problem is shown to be BQP-complete, providing a strong evidence for a quantum advantage. We benchmark the quantum algorithm via numerical experiments by simulating a vortex flow in the 2D Navier Stokes equation.
