How many functions can be distinguished with k quantum queries?
Quantum Physics
2009-10-31 v2
Abstract
Suppose an oracle is known to hold one of a given set of D two-valued functions. To successfully identify which function the oracle holds with k classical queries, it must be the case that D is at most 2^k. In this paper we derive a bound for how many functions can be distinguished with k quantum queries.
Cite
@article{arxiv.quant-ph/9901012,
title = {How many functions can be distinguished with k quantum queries?},
author = {E. Farhi and J. Goldstone and S. Gutmann and M. Sipser},
journal= {arXiv preprint arXiv:quant-ph/9901012},
year = {2009}
}
Comments
5 pages. Lower bound on sorting n items improved to (1-epsilon)n quantum queries. Minor changes to text and corrections to references