Skip to content
Better HN
Top
Best
Ask
Show
New
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
4mo ago
1 comments
Save
Share
1 comments
1 comments · 1 top-level
top
newest
oldest
compressedgas
4mo ago
I don't think classical and quantum complexity can be compared like that.
j
/
k
navigate · click thread line to collapse
