Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo (arxiv.org) 4 points by limoce 7mo ago ↗ HN
[–] compressedgas 7mo ago ↗ I don't think classical and quantum complexity can be compared like that.
1 comment
[ 3.5 ms ] story [ 17.5 ms ] thread