Quantum algorithm for linear systems of equations.

Explore this paper's citation graph

Summary

This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm.

Type
article
Published
2008-11-19
Cited by
3,297
References
38
Access
Open access

Keywords

Combinatorics, Physics, Quantum algorithm, Mathematical physics, Quantum

References

Cited by

Related papers