Randomized communication complexity for linear algebra problems over finite fields

Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger [3] first considered this problem in the communication complexity model, in which Alice holds the first half of the matrix and Bob holds the other half. They proved that the deterministic communication complexity is Ω(n2 log p) for an n×n matrix over the finite field Fp. Then, Clarkson and Woodruff [4] introduced the singularity problem to the streaming model. They proposed a randomized one pass streaming algorithm that uses O(k2 logn) space to decide if the rank of a matrix is k, and proved an Ω(k2) lower bound for randomized one-way protocols in the communication complexity model. We prove that the randomized/quantum communication complexity of the singularity problem over Fp is Ω(n2 log p), which implies the same space lower bound for randomized streaming algo-rithms, even for a constant number of passes. The proof uses the framework by Lee and Shraib-man [8], but we choose Fourier coefficients as the witness for the dual approximate norm of the communication matrix. Moreover, we use Fourier analysis to show the same randomized/quantum lower bound when deciding if the determinant of a non-singular matrix is a or b for non-zero a and b.