Skip to content
Better HN
Top
New
Best
Ask
Show
Jobs
Search
⌘K
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
(opens in new tab)
(arxiv.org)
4 points
limoce
1mo ago
1 comments
Share
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo | Better HN
1 comments
default
newest
oldest
compressedgas
1mo ago
I don't think classical and quantum complexity can be compared like that.
j
/
k
navigate · click thread line to collapse
