STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Guessing secrets efficiently via list decoding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Guessing Secrets problem: a probabilistic approach
Journal of Algorithms
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
SIAM Journal on Computing
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Two cooperative versions of the Guessing Secrets problem
Information Sciences: an International Journal
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
| Hi-index | 0.00 |
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover the identity of two objects from a known finite set Ω by asking yes/no questions. The best known classical algorithm requires O(log N) questions and O(log2 N) steps to process the answers, where N = |Ω|. We apply the Deutsch-Jozsa algorithm and show that the number of necessary calls to the oracle is independent of the size of the domain and that the output from each run of the algorithm has immediate meaning. In doing so, we extend the types of questions that the quantum algorithms can be used to solve.