Natural sciences2026 · shared on Hacker News
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
Explore Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Ylimoce ·
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
3 points0 comments