Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning

Overview of attention for article published in arXiv, June 2020

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
High Attention Score compared to outputs of the same age (86th percentile)
High Attention Score compared to outputs of the same age and source (94th percentile)

Mentioned by

twitter: 22 X users

q&a: 2 Q&A threads

Readers on

mendeley: 57 Mendeley

So far, Altmetric has seen 2 Q&A posts from 2 users.

Is there any firm evidence that quantum computers can be more powerful than classical?

Posted by Nikita Nemkov, at quantumcomputing.stackexchange.com, 15 Apr 2021

I am new to the field and I am very confused about the status of things right now. Sorry, but this confusion also spills into…

Consequences of BPP=BQP

Posted by Simd, at cstheory.stackexchange.com, 25 Nov 2019

If BPP=BQP then there is a polynomial time randomized factoring algorithm. A lot of other quantum algorithms that appeared to…

This page shows the most recent Q&A posts that mention this research output. Click here to find out how to access more activity.