1 citations · 1 across the 2 of their papers we have counts for
3 papers
quant-ph2026
The quantum query complexity of the semigroup product problem
Troy Lee, Miklos Santha
We study the quantum query complexity of computing a semigroup product , when one query reveals one input element and the multiplication table is given. For a finite…
quant-ph2023★ 1 cited
On the quantum time complexity of divide and conquer
Jonathan Allcock, Jinge Bao, Aleksandrs Belovs +2
We initiate a systematic study of the time complexity of quantum divide and conquer algorithms for classical problems. We establish generic conditions under which search and minimi…
quant-ph2012
New bounds on the classical and quantum communication complexity of some graph properties
Gabor Ivanyos, Hartmut Klauck, Troy Lee +2
We study the communication complexity of a number of graph properties where the edges of the graph are distributed between Alice and Bob (i.e., each receives some of the edges…