How many functions can be distinguished with k quantum queries?
classification
🪐 quant-ph
keywords
functionsqueriesdistinguishedmanyoraclequantumboundcase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.