hrhgroup
Full Member level 3
Dear Friends
Here are those:
1. Suppose in the Deutsch problem, the problem is not to distinguish between the constant and balanced functions with certainty, but rather, with some probability of error epsilon<1/2. What is the expected number of queries needed to resolve the question using classical gates?
2. Suppose in the Deutsch problem, the problem is not to distinguish between the constant and balanced functions, but rather, to distinguish between the constant and non-constant functions with certainty. Find a clever way that takes the least number of queries.
Thanks
Here are those:
1. Suppose in the Deutsch problem, the problem is not to distinguish between the constant and balanced functions with certainty, but rather, with some probability of error epsilon<1/2. What is the expected number of queries needed to resolve the question using classical gates?
2. Suppose in the Deutsch problem, the problem is not to distinguish between the constant and balanced functions, but rather, to distinguish between the constant and non-constant functions with certainty. Find a clever way that takes the least number of queries.
Thanks
