Dhrumil Patel

A Near-Optimal Joint Lower Bound for Sparse Quantum Linear System Solvers

Quantum linear system solvers form one of the central algorithmic primitives in quantum computing, with applications ranging from differential equations and optimization to machine learning. Their cost is commonly measured through query complexity, which counts the number of oracle calls needed to access the input matr...