As the “quantum supremacy” was declared by Google in 2019, we are now in the “noisy intermediate-scale quantum” (NISQ) era. What can a numerical analyst do with a quantum computer (if it works)? This talk discusses some recent progresses on quantum algorithms for solving linear algebra problems. In particular, we introduce simple algorithms based on adiabatic quantum computing (AQC) to solve Ax=bAx=b on a quantum computer, with near-optimal complexity ~O(κ/ϵ)O~(κ/ϵ). Here κκ is the condition number, and ϵϵ is the target accuracy. No prior knowledge on quantum computing is needed.