71 citations · 455 across the 36 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
quant-ph2005★ 57 cited
The Communication Complexity of the Hamming Distance Problem
Wei Huang, Yaoyun Shi, Shengyu Zhang +1
We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no le…
quant-ph2005★ 4 cited
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
Shengyu Zhang
The Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to many areas in computer science an…