Efficient Quantum Algorithm for Solving Finite Element Discretizations of Elliptic PDEs

This paper presents a quantum algorithm for solving second-order linear elliptic partial differential equations discretized by d-linear finite elements on Cartesian grids. The algorithm achieves a complexity linear in the inverse tolerance, which is optimal and improves previous quantum algorithms by a factor of the tolerance squared.