We present a class of fast quantum algorithms, based on Bernstein and Vazirani's parity problem, that retrieves the entire contents of a quantum database Y in a single query. The class includes binary search problems and coin-weighing problems. We compare the efficiency of these quantum algorithms with the classical algorithms that are bounded by the classical information-theoretic bound. We show the connection between classical algorithms based on several compression codes and our quantum-mechanical method.
Physical Review A
- Pub Date:
- September 1998
- Quantum computation;
- Information theory and communication theory;
- Quantum Physics
- Replaced with expanded version, 6 pages revtex, 12 November 1997. Replaced again to fix small typographical errors, submitted to Phys. Rev. A