Exact quantum query complexity of $\rm{EXACT}_{k,l}^n$
Quantum Physics
2018-01-11 v2 Computational Complexity
Abstract
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 or of the 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.
Cite
@article{arxiv.1608.02374,
title = {Exact quantum query complexity of $\rm{EXACT}_{k,l}^n$},
author = {Andris Ambainis and Jānis Iraids and Daniel Nagaj},
journal= {arXiv preprint arXiv:1608.02374},
year = {2018}
}
Comments
19 pages, fixed some typos and constraints