Quantum preconditioning method for linear systems problems via Schrödingerization

We present a quantum computational framework that systematically converts classical linear iterative algorithms with fixed iteration operators into their quantum counterparts using the Schrödingerization technique [Shi Jin, Nana Liu and Yue Yu, Phys. Rev. Lett., vol. 133 No. 230602,2024]. This is achieved by capturing the steady state of the associated differential equations. The Schrödingerization technique transforms linear partial and ordinary differential equations into Schrödinger-type systems, making them suitable for quantum computing. This is accomplished through the so-called warped phase transformation, which maps the equation into a higher-dimensional space. Building on this framework, we develop a quantum preconditioning algorithm that leverages the well-known BPX multilevel preconditioner for the finite element discretization of the Poisson equation. The algorithm achieves a near-optimal dependence on the number of queries to our established input models, with a complexity of $\mathcal{O}(\text{polylog}\frac{1}{\epsilon })$ for a target accuracy of $\epsilon$ when the dimension $d\ge 2$. This improvement results from the Hamiltonian simulation strategy applied to the Schrödingerized preconditioning dynamics, coupled with the smoothing of initial data in the extended space.