Exact quantum query complexity of ${\mathrm{EXACT}}_{\mathrm{k},\mathrm{l}}^{\mathrm{n}}$

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 $k$ or $l$ 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.

19 pages, fixed some typos and constraints

Cited by in corpus (1)

• Variational learning algorithms for quantum query complexity