2008/11/30 by Aram W. Harrow, Avinatan Hassidim, Seth Lloyd · 1 voice · 28 citations
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1103/physrevlett.103.150502
published as Phys. Rev. Lett. vol. 15, no. 103, pp. 150502 (2009) · 15 pages. v2 is much longer, with errors fixed, run-time improved and a new BQP-completeness result added. v3 is the final published version and mostly adds clarifications and corrections to v2
arxiv created 2009/09/30 · arxiv updated 2009/12/01
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need to know the solution x itself, but rather an approximation of the expectation value of some operator associated with x, e.g., x'Mx for some matrix M. In this case, when A is sparse, N by N and has condition number kappa, classical algorithms can find x and estimate x'Mx in O(N sqrt(kappa)) time. Here, we exhibit a quantum algorithm for this task that runs in poly(log N, kappa) time, an exponential improvement over the best classical algorithm.