Adversary Lower Bound for Element Distinctness with Small Range

2014.

Cited by: 2|Bibtex|Views4|Links

Abstract:

The Element Distinctness problem is to decide whether each character of an input string is unique. The quantum query complexity of Element Distinctness is known to be $\Theta(N^{2/3})$; the polynomial method gives a tight lower bound for any input alphabet, while a tight adversary construction was only known for alphabets of size $\Omeg...More

Code:

Data:

Your rating :
0

 

Tags
Comments