Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods
David Dechant, Liubov Markovich, Vedran Dunjko, Jordi Tura

TL;DR
This paper provides a detailed error and resource analysis for variational quantum algorithms that use Runge-Kutta methods to solve differential equations, aiming to optimize their efficiency on near-term quantum devices.
Contribution
It offers the first rigorous error and resource estimates for variational Runge-Kutta quantum algorithms, including shot noise and truncation errors, guiding their practical implementation.
Findings
Order 4 methods are most resource-efficient for 1D ODEs.
Order 2 methods are optimal for option pricing PDEs.
Analysis excludes hardware noise and representation errors.
Abstract
A focus of recent research in quantum computing has been on developing quantum algorithms for differential equations solving using variational methods on near-term quantum devices. A promising approach involves variational algorithms, which combine classical Runge-Kutta methods with quantum computations. However, a rigorous error analysis, essential for assessing real-world feasibility, has so far been lacking. In this paper, we provide an extensive analysis of error sources and determine the resource requirements needed to achieve specific target errors. In particular, we derive analytical error and resource estimates for scenarios with and without shot noise, examining shot noise in quantum measurements and truncation errors in Runge-Kutta methods. Our analysis does not take into account representation errors and hardware noise, as these are specific to the instance and the used…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
