Exact Quantum Query Complexity of \text EXACT_k, l^n.

In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or 1 of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.