Abstract
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many oracle-queries k and for how many bits n one querying procedure is more efficient than the other.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.