Le Gall: Quantum Complexity of Matrix Multiplication
Francois Le Gall, The University of Tokyo
In this talk I will describe recent progresses in the development of quantum algorithms for matrix multiplication. I will start with the case of Boolean matrices, and discuss the time complexity and query complexity of Boolean matrix multiplication in the quantum setting.