Divergence-free algorithms for solving nonlinear differential equations on quantum computers
Katsuhiro Endo, Kazuaki Z. Takahashi

TL;DR
This paper introduces divergence-free quantum algorithms for solving nonlinear differential equations, overcoming the evolution time limit of existing methods and enabling practical quantum computing applications.
Contribution
The authors propose a novel divergence-free simulation algorithm that prevents solution divergence in quantum algorithms for nonlinear differential equations.
Findings
The method breaks through the theoretical evolution time limit.
Hamiltonian simulations demonstrate the effectiveness of the approach.
Solutions are obtained without the usual time constraints of quantum algorithms.
Abstract
From weather to neural networks, modeling is not only useful for understanding various phenomena, but also has a wide range of potential applications. Although nonlinear differential equations are extremely useful tools in modeling, their solutions are difficult to obtain. Based on the expectation of quantum transcendence, quantum algorithms for efficiently solving nonlinear differential equations continue to be developed. However, even the latest promising algorithms have been pointed out to have an evolution time limit. This limit is the theoretically predestined divergence of solutions. We propose algorithms of divergence-free simulation for nonlinear differential equations in quantum computers. For Hamiltonian simulations, a pivot state in the neighborhood of state is introduced. Divergence of the solutions is prevented by moving to a neighborhood of…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
