Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, $$n$$n, as well as the number of $$1$$1s in the output, $$\ell $$l. We prov...