Not yet reviewed by Pith; the record is open.

Differential equations are a crucial mathematical tool used in a wide range of applications. If the solution to an initial value problem (IVP) can be transformed into an oracle, it can be utilized in various fields such as search and optimization, achieving quadratic speedup with respect to the number of candidates compared to its classical counterpart. In the past, attempts have been made to implement such an oracle using the Euler method. In this study, we propose a quantum linear multistep method (QLMM) that applies the linear multistep method, commonly used to numerically solve IVPs on classical computers, to generate a numerical solution of the IVP for use in a quantum oracle. We also propose a method to find the optimal form of QLMM for a given IVP. Finally, through computer simulations, we derive the QLMM formulation for an example IVP and show that the solution from the optimized QLMM can be used in an optimization problem.