Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo(arxiv.org)
arxiv.org
Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
https://arxiv.org/abs/2602.05541
1 comments
I don't think classical and quantum complexity can be compared like that.