Quantum algorithm for solving linear systems of equations · HackerPapers discussions

Quantum algorithm for solving linear systems of equations — mentioned by cvoss

Sun, 11 Jun 2017 20:01:57 GMT

Exponentially better than a polynomial in N is a polynomial in log N. See the abstract of [1] for the precise complexity claim about the algorithm mentioned in the article. As good as N^3 sounds, it's still not great on enormous systems. [1] https://arxiv.org/abs/0811.3171

Paper and discussion history. A mention is not an endorsement.

Quantum algorithm for solving linear systems of equations — mentioned by drkevorkian

Fri, 28 Jun 2013 20:57:43 GMT

He might be referring to this: http://arxiv.org/pdf/0811.3171v3.pdf So, if the question you want to ask is "what is some property of the solution of the (sparse) set of linear equations" rather than wanting to know the (inherently O(n)) solution itself, you can get exponential speedup.

Paper and discussion history. A mention is not an endorsement.

Quantum algorithm for solving linear systems of equations — HN submission

Mon, 16 Nov 2009 09:46:06 GMT

Quantum algorithm for solving linear systems of equations

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.