Hacker News
new
top
best
ask
show
job
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
(
arxiv.org
)
3 points
by
limoce
7 hours ago
1 comment
compressedgas
2 hours ago
I don't think classical and quantum complexity can be compared like that.