Fast and Practical Quantum-Inspired Classical Algorithms for Solving Linear Systems
share
We propose fast and practical quantum-inspired classical algorithms for solving linear systems. Specifically, given sampling and query access to a matrix A∈ℝ^m× n and a vector b∈ℝ^m, we propose classical algorithms that produce a data structure for the solution x∈ℝ^n of the linear system Ax=b with the ability to sample and query its entries. The resulting x satisfies x-A^+b≤ϵA^+b, where · is the spectral norm and A^+ is the Moore-Penrose inverse of A. Our algorithm has time complexity O(κ_F^4/κϵ^2) in the general case, where κ_F =A_FA^+ and κ=AA^+ are condition numbers. Compared to the prior state-of-the-art result [Shao and Montanaro, arXiv:2103.10309v2], our algorithm achieves a polynomial speedup in condition numbers. When A is s-sparse, our algorithm has complexity O(s κlog(1/ϵ)), matching the quantum lower bound for solving linear systems in κ and 1/ϵ up to poly-logarithmic factors [Harrow and Kothari]. When A is s-sparse and symmetric positive-definite, our algorithm has complexity O(s√(κ)log(1/ϵ)). Technically, our main contribution is the application of the heavy ball momentum method to quantum-inspired classical algorithms for solving linear systems, where we propose two new methods with speedups: quantum-inspired Kaczmarz method with momentum and quantum-inspired coordinate descent method with momentum. Their analysis exploits careful decomposition of the momentum transition matrix and the application of novel spectral norm concentration bounds for independent random matrices. Finally, we also conduct numerical experiments for our algorithms on both synthetic and real-world datasets, and the experimental results support our theoretical claims.
READ FULL TEXT