Symbol m

The passage around this formula

…up to polynomial factors, by a classical algorithm nobody had previously constructed: $T_{\text{classical}} = O\!\left(\mathrm{poly}(k)\log(mn)\right) \approx T_{\text{quantum}}$. where the classical algorithm samples from an $\ell^2$ -norm-weighted data structure rather than reading the whole m $\times$ n matrix, closing a gap previously measured only against a classical algorithm that read every entry [ 13 ] . The general lesson, sometimes called dequantization, is that an apparent exponential quantum speedup often measures the gap between a quantum algorithm and an unnecessarily weak…

Read this part in the article →