Answers are grounded in this paper and cite their sources.
Harrow, Hassidim, and Lloyd [Phys. Rev. Lett., 103 (2009), 150502] showed that for a suitably specified N × N matrix A and an N-dimensional vector b⃗, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of equations Ax⃗ = b⃗. If A is sparse and well-conditioned, their algorithm runs in time poly(log N, 1/ε), where ε is the desired precision in the output state. We improve this to an algorithm whose running time is polynomial in log(1/ε), exponentially improving the dependence on precision while keeping essentially the same dependence on other parameters. Our algorithm is based on a general technique for implementing any operator with a suitable Fourier or Chebyshev series representation. This allows us to bypass the quantum phase estimation algorithm, whose dependence on ε is prohibitive.
No takes yet. Share an insight, caveat, or question.
Childs et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: