APA (7th ed.) Citation

Yao, J., & Liu, D. (2026). Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm.

Chicago Style (17th ed.) Citation

Yao, Jiaqi, and Ding Liu. Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm. 2026.

MLA (9th ed.) Citation

Yao, Jiaqi, and Ding Liu. Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm. 2026.