6 citations · 24 across the 17 of their papers we have counts for
3 papers · 1 filter
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
Arjan Cornelissen, Nikhil S. Mande, Maris Ozols +1
We study the problem of computing the Hamming weight of an -bit string modulo , for any positive integer whose only prime factors are 2 and 3. We show that the exa…
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error
Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability , getting optimal constant factors in the…
One-way communication complexity and non-adaptive decision trees
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
We study the relationship between various one-way communication complexity measures of a composed function with the analogous decision tree complexity of the outer function. We con…