A Residual-Based Quantum Linear System Algorithm with Dynamic Stopping and Applications to Elliptic PDEs

Quantum linear-system algorithms (QLSAs) have rigorous worst-case complexity guarantees, but their runtimes are often chosen from spectral information assumed in advance. What is largely lacking is an a posteriori progress flag: most QLSA workflows, unlike the classical counterparts, do not provide a built-in mechanism to signal whether a particular instance has already converged. For discretizations of elliptic PDEs $-\nabla\cdot(a(x)\nabla u(x))=f(x),$ with divergence--gradient structure [ -\nabla\cdot \big(a(x)\nabla) \approx A_h=G_h^\dagger G_h, ] we formulate a stable first-order ODE whose limiting solution block is the desired Galerkin solution. The PDE-dependent scale is then (\norm{G_h}=\bigO(h^{-1})), comparable to factorized QLSA constructions with square-root condition-number scaling. We design an augmented dynamics with residual variables, in which measuring a residual register gives an on-the-fly convergence indicator without reconstructing the solution vector. For smooth right-hand sides, dynamic stopping can reduce the evolution time and gate count relative to a fixed worst-case schedule, and may also reduce exposure to accumulated hardware errors. Numerical experiments for a two-dimensional finite element Poisson problem show that the residual-register probability follows the actual error decay and, for some right-hand sides, can stop the quantum circuit well before a conservative worst-case runtime estimate is reached.

Source: arXiv:2605.06414v1 - http://arxiv.org/abs/2605.06414v1 PDF: https://arxiv.org/pdf/2605.06414v1 Original Link: http://arxiv.org/abs/2605.06414v1