Schrödingerization for quantum linear systems problems with near-optimal dependence on matrix queries

Abstract

We develop a quantum algorithm for linear algebraic equations $ A\bb{x} = \bb{b} $ from the perspective of Schrödingerization-form problems, which are characterized by a system of linear convection equations in one higher dimension. When $ A $ is positive definite, the solution $ \bb{x} $ can be interpreted as the steady-state solution to a system of linear ordinary differential equations (ODEs). This ODE system can be solved by using the linear combination of Hamiltonian simulation (LCHS) method in \cite{ACL2023LCH2}, which serves as the continuous implementation of the Fourier transform in the Schrödingerization method from \cite{JLY22SchrShort, JLY22SchrLong}. Schrödingerization transforms linear partial differential equations (PDEs) and ODEs with non-unitary dynamics into Schrödinger-type systems via the so-called warped phase transformation that maps the equation into one higher dimension. When $ A $ is a general Hermitian matrix, the inverse matrix can still be represented in the LCHS form in \cite{ACL2023LCH2}, but with a kernel function based on the Fourier approach in \cite{Childs2017QLSA}. Although this LCHS form provides the steady-state solution to a system of linear ODEs associated with the least-squares equation, applying Schrödingerization to this least-squares system is not appropriate, as it results in a much larger condition number. We demonstrate that in both cases, the solution $ \bb{x} $ can be expressed as the LCHS of Schrödingerization-form problems. We provide a detailed implementation and error analysis. Furthermore, we incorporate a block preconditioning technique to achieve nearly linear scaling in the condition number, thereby attaining near-optimal query complexity.