Quantum algorithm for solving linear systems of equations
By Aram Wettroth Harrow. 2010
221 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/44f079df32015f01573e81886dd158f9a874e638
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Marcello Benedetti
- Edward Grant
- Seth Lloyd
- Aram Wettroth Harrow
- Shuxiang Cao
- Simone Severini
- Avinatan Hassidim
- Andrew Hallam
Citations in the corpus
- Quantum algorithm for linear systems of equations. (2008, background): “[15] shows how to simulate e in time Õ(log(N)st), where the Õ suppresses more slowly-growing terms (included in the supporting material [3]).”
- Hierarchical quantum classifiers (2018, background): “Whilst promising, these algorithms also inherit the limitations of HHL, in particular, the requirement that classical data be efficiently prepared in amplitude encoding.”
- Quantum algorithms: an overview (2015, unknown): “Assuming these constraints, j x i can be approximately produced in time polynomial in log N , d , and (cid:20) [47, 4].”