Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
1–2 of 2 posts
Re: Reduce Complexity of Matmul to O(N^2logN) by Asymptotically Optimal Quantum Algo
#2I don't think classical and quantum complexity can be compared like that.