9 citations · 14 across the 6 of their papers we have counts for
1 paper · 1 filter
Troy Lee, Adi Shraibman
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix--the m…