Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions · HackerPapers discussions

Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions — mentioned by Strilanc

Sun, 05 Sep 2021 06:16:41 GMT

This might be coming up again because the paper was finally published, like in a journal after peer-review, one month ago [1]. The pre-print has been available since 2018 [2]. [1]: https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.12... [2]: https://arxiv.org/abs/1811.00414

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

Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions — mentioned by outlace

Mon, 23 Sep 2019 03:41:57 GMT

I guess you're right, I remember seeing quantum algorithms that were assumed to be more efficient than any classical algorithm and then people devised equally efficient classical algorithms. E.g. work by Ewin Tang https://arxiv.org/abs/1811.00414

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

Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions — HN submission

Sun, 11 Nov 2018 19:12:35 GMT

Quantum-inspired classical algorithms for PCA and supervised clustering

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