Single quantum querying of a database
Quantum Physics
2008-12-30 v4
Abstract
We present a class of fast quantum algorithms, based on Bernstein and Vazirani's parity problem, that retrieve the entire contents of a quantum database in a single query. The class includes binary search problems and coin-weighing problems. Our methods far exceed the efficiency of classical algorithms which 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.
Keywords
Cite
@article{arxiv.quant-ph/9705041,
title = {Single quantum querying of a database},
author = {B. M. Terhal and J. A. Smolin},
journal= {arXiv preprint arXiv:quant-ph/9705041},
year = {2008}
}
Comments
Replaced with expanded version, 6 pages revtex, 12 November 1997. Replaced again to fix small typographical errors, submitted to Phys. Rev. A