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, , as well as the number of s in the output, . We prove an upper bound of for all values of . This is an improvement over previous algorithms for all values of . On the other hand, we show that for any and any , there is an lower bound for this problem, showing that our algorithm is essentially tight. We first reduce Boolean matrix multiplication to several instances of graph collision. We then provide an algorithm that takes advantage of the fact that the underlying graph in all of our instances is very dense to find all graph collisions efficiently. Using similar ideas, we also show that the time complexity of Boolean matrix multiplication is .