The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Suppose we have k matrices of size n by n. We are given an oracle that knows all the entries of k matrices, that is, we can query the oracle an (i,j) entry of the l-th matrix. The goal is to test if each pair of k matrices commute with each other or not with as few queries to the oracle as possible. In order to solve this problem, we use a theorem of Mario Szegedy (quant-ph/0401053) that relates a hitting time of a classical random walk to that of a quantum walk. We also take a look at anotherarXiv:quant-ph/0509206v1 fatcat:d2vtqjggnrdgtbflzrke6rpmqa