Y
Hacker News
new
|
ask
|
show
|
jobs
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
(
arxiv.org
)
4 points
by
limoce
139 days ago
1 comments
compressedgas
139 days ago
I don't think classical and quantum complexity can be compared like that.
link